fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251918200204
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5981.655 3600000.00 14050316.00 812.30 FTF?TFFFFFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918200204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.8K Apr 29 21:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 21:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 99K Apr 29 21:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 29 21:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 434K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652585308647

Running Version 202205111006
[2022-05-15 03:28:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 03:28:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 03:28:30] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2022-05-15 03:28:30] [INFO ] Transformed 68 places.
[2022-05-15 03:28:30] [INFO ] Transformed 548 transitions.
[2022-05-15 03:28:30] [INFO ] Parsed PT model containing 68 places and 548 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 26 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:28:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:28:30] [INFO ] Computed 5 place invariants in 13 ms
[2022-05-15 03:28:30] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
[2022-05-15 03:28:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:28:30] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:28:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-15 03:28:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:28:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:30] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2022-05-15 03:28:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:28:30] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:28:31] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 66/68 places, 548/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/68 places, 548/548 transitions.
Support contains 66 out of 66 places after structural reductions.
[2022-05-15 03:28:31] [INFO ] Flatten gal took : 84 ms
[2022-05-15 03:28:31] [INFO ] Flatten gal took : 74 ms
[2022-05-15 03:28:31] [INFO ] Input system was already deterministic with 548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:28:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:28:32] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-15 03:28:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:28:32] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:28:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:28:32] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:28:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:32] [INFO ] After 92ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:28:32] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2022-05-15 03:28:33] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 63 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 61 transition count 544
Applied a total of 9 rules in 89 ms. Remains 61 /66 variables (removed 5) and now considering 544/548 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/66 places, 544/548 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Finished probabilistic random walk after 173473 steps, run visited all 2 properties in 709 ms. (steps per millisecond=244 )
Probabilistic random walk after 173473 steps, saw 50096 distinct states, run finished after 709 ms. (steps per millisecond=244 ) properties seen :2
Computed a total of 49 stabilizing places and 84 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(p0)&&p1)))))'
Support contains 13 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 63 transition count 546
Applied a total of 5 rules in 69 ms. Remains 63 /66 variables (removed 3) and now considering 546/548 (removed 2) transitions.
[2022-05-15 03:28:34] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
// Phase 1: matrix 128 rows 63 cols
[2022-05-15 03:28:34] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 03:28:34] [INFO ] Implicit Places using invariants in 116 ms returned []
[2022-05-15 03:28:34] [INFO ] Flow matrix only has 128 transitions (discarded 418 similar events)
// Phase 1: matrix 128 rows 63 cols
[2022-05-15 03:28:34] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 03:28:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:34] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 351 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/66 places, 546/548 transitions.
Applied a total of 0 rules in 34 ms. Remains 61 /61 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/66 places, 546/548 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s45 1) (GEQ s59 1)) (AND (GEQ s45 1) (GEQ s57 1)) (AND (GEQ s45 1) (GEQ s58 1)) (AND (GEQ s45 1) (GEQ s55 1)) (AND (GEQ s45 1) (GEQ s56 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 129 steps with 0 reset in 12 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-00 finished in 753 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)&&p1))))'
Support contains 37 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 23 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:28:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:28:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:35] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
[2022-05-15 03:28:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:28:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:35] [INFO ] Implicit Places using invariants in 61 ms returned []
[2022-05-15 03:28:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:28:35] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:28:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:35] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 207 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/66 places, 548/548 transitions.
Applied a total of 0 rules in 31 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/66 places, 548/548 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s31 1) (GEQ s57 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s41 1) (GEQ s59 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s36 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 9 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-02 finished in 551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((G(p1)&&p0))))))'
Support contains 15 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 39 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:28:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:28:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:35] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
[2022-05-15 03:28:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:28:35] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:28:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-15 03:28:36] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:28:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:36] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 297 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/66 places, 547/548 transitions.
Applied a total of 0 rules in 24 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 39 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s23 20) (LT s50 1)) (OR (LT s23 20) (LT s49 1))), p1:(AND (OR (LT s47 1) (LT s61 1)) (OR (LT s47 1) (LT s59 1)) (OR (LT s47 1) (LT s60 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 586 reset in 501 ms.
Product exploration explored 100000 steps with 585 reset in 460 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 328 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 43 ms :[(OR (NOT p1) (NOT p0))]
[2022-05-15 03:28:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 03:28:38] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-15 03:28:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 03:28:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 03:28:38] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-15 03:28:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 67 ms returned sat
[2022-05-15 03:28:38] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 27 ms.
[2022-05-15 03:28:38] [INFO ] Added : 11 causal constraints over 4 iterations in 157 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 15 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 28 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:28:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:38] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:28:38] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
[2022-05-15 03:28:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:38] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-05-15 03:28:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:39] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2022-05-15 03:28:39] [INFO ] Redundant transitions in 36 ms returned []
[2022-05-15 03:28:39] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:28:39] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 231 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(OR (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 245 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 37 ms :[(OR (NOT p1) (NOT p0))]
[2022-05-15 03:28:40] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 03:28:40] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-15 03:28:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 03:28:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:28:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 03:28:40] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-15 03:28:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 68 ms returned sat
[2022-05-15 03:28:40] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 25 ms.
[2022-05-15 03:28:40] [INFO ] Added : 11 causal constraints over 4 iterations in 130 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 585 reset in 436 ms.
Product exploration explored 100000 steps with 585 reset in 428 ms.
Built C files in :
/tmp/ltsmin10468993543131426161
[2022-05-15 03:28:41] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2022-05-15 03:28:41] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:41] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2022-05-15 03:28:41] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:41] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2022-05-15 03:28:41] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:41] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10468993543131426161
Running compilation step : cd /tmp/ltsmin10468993543131426161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1738 ms.
Running link step : cd /tmp/ltsmin10468993543131426161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10468993543131426161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2388015475408251576.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 15 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 31 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:28:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:28:56] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
[2022-05-15 03:28:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:56] [INFO ] Implicit Places using invariants in 79 ms returned []
[2022-05-15 03:28:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:28:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:28:57] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2022-05-15 03:28:57] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-15 03:28:57] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:28:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:28:57] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin2821318880537655285
[2022-05-15 03:28:57] [INFO ] Computing symmetric may disable matrix : 547 transitions.
[2022-05-15 03:28:57] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:57] [INFO ] Computing symmetric may enable matrix : 547 transitions.
[2022-05-15 03:28:57] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:57] [INFO ] Computing Do-Not-Accords matrix : 547 transitions.
[2022-05-15 03:28:57] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:28:57] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2821318880537655285
Running compilation step : cd /tmp/ltsmin2821318880537655285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1752 ms.
Running link step : cd /tmp/ltsmin2821318880537655285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2821318880537655285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8497163474913606879.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 03:29:12] [INFO ] Flatten gal took : 35 ms
[2022-05-15 03:29:12] [INFO ] Flatten gal took : 31 ms
[2022-05-15 03:29:12] [INFO ] Time to serialize gal into /tmp/LTL13007446701799217259.gal : 8 ms
[2022-05-15 03:29:12] [INFO ] Time to serialize properties into /tmp/LTL18278562103150467285.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13007446701799217259.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18278562103150467285.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1300744...268
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(((G("(((((((CHOIX_1<1)||(COMPTEUR_9<1))&&((CHOIX_1<1)||(COMPTEUR_7<1)))&&(((CHOIX_1<1)||(COMPTEUR_8<1))&&((CHOIX_1<1)||(COM...775
Formula 0 simplified : !FGFG("((CAPACITE<20)||(VIDANGE_1<1))" & "((CAPACITE<20)||(VIDANGE_2<1))" & G"(((((((CHOIX_1<1)||(COMPTEUR_9<1))&&((CHOIX_1<1)||(COM...759
Detected timeout of ITS tools.
[2022-05-15 03:29:27] [INFO ] Flatten gal took : 27 ms
[2022-05-15 03:29:27] [INFO ] Applying decomposition
[2022-05-15 03:29:27] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1128935972410502316.txt' '-o' '/tmp/graph1128935972410502316.bin' '-w' '/tmp/graph1128935972410502316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1128935972410502316.bin' '-l' '-1' '-v' '-w' '/tmp/graph1128935972410502316.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:29:27] [INFO ] Decomposing Gal with order
[2022-05-15 03:29:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:29:27] [INFO ] Removed a total of 953 redundant transitions.
[2022-05-15 03:29:27] [INFO ] Flatten gal took : 209 ms
[2022-05-15 03:29:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 8 ms.
[2022-05-15 03:29:27] [INFO ] Time to serialize gal into /tmp/LTL4107835426044479466.gal : 2 ms
[2022-05-15 03:29:27] [INFO ] Time to serialize properties into /tmp/LTL636087151230167243.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4107835426044479466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL636087151230167243.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4107835...244
Read 1 LTL properties
Checking formula 0 : !((F(G(F(G(((G("(((((((u1.CHOIX_1<1)||(i2.u3.COMPTEUR_9<1))&&((u1.CHOIX_1<1)||(i2.u3.COMPTEUR_7<1)))&&(((u1.CHOIX_1<1)||(i2.u3.COMPTEU...970
Formula 0 simplified : !FGFG("((u1.CAPACITE<20)||(i2.u0.VIDANGE_2<1))" & "((u1.CAPACITE<20)||(u2.VIDANGE_1<1))" & G"(((((((u1.CHOIX_1<1)||(i2.u3.COMPTEUR_9...954
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2273596678172790293
[2022-05-15 03:29:43] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2273596678172790293
Running compilation step : cd /tmp/ltsmin2273596678172790293;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 979 ms.
Running link step : cd /tmp/ltsmin2273596678172790293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2273596678172790293;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](<>([](([]((LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-03 finished in 82423 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(((F((p1 U X(!p2)))&&p2)||p0)))))'
Support contains 35 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 10 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:29:58] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:29:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:29:58] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
[2022-05-15 03:29:58] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:29:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2022-05-15 03:29:58] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:29:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:29:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:29:58] [INFO ] Implicit Places using invariants and state equation in 165 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 257 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 547/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s47 1) (GEQ s59 1)) (AND (GEQ s47 1) (GEQ s60 1)) (AND (GEQ s47 1) (GEQ s57 1)) (AND (GEQ s47 1) (GEQ s58 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28000 reset in 906 ms.
Product exploration explored 100000 steps with 27839 reset in 887 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Finished random walk after 544 steps, including 3 resets, run visited all 2 properties in 6 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Support contains 35 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:30:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:30:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:01] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
[2022-05-15 03:30:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:30:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:01] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-15 03:30:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:30:01] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 03:30:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-05-15 03:30:01] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:30:01] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 03:30:01] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 03:30:02] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:30:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:02] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2022-05-15 03:30:03] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 03:30:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:03] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 03:30:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:03] [INFO ] After 265ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 03:30:04] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 271 ms.
[2022-05-15 03:30:04] [INFO ] After 1181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 35 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 547/547 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 61 transition count 546
Applied a total of 3 rules in 20 ms. Remains 61 /63 variables (removed 2) and now considering 546/547 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/63 places, 546/547 transitions.
Finished random walk after 5621 steps, including 43 resets, run visited all 1 properties in 42 ms. (steps per millisecond=133 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Product exploration explored 100000 steps with 27955 reset in 869 ms.
Product exploration explored 100000 steps with 27771 reset in 899 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) p2), (NOT p0)]
Support contains 35 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 547/547 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 547
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 30 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:30:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:30:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:07] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
[2022-05-15 03:30:07] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-15 03:30:07] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2022-05-15 03:30:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:07] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/63 places, 547/547 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 547/547 transitions.
Product exploration explored 100000 steps with 27961 reset in 1174 ms.
Product exploration explored 100000 steps with 27836 reset in 1168 ms.
Built C files in :
/tmp/ltsmin7276120678738699352
[2022-05-15 03:30:09] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7276120678738699352
Running compilation step : cd /tmp/ltsmin7276120678738699352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1078 ms.
Running link step : cd /tmp/ltsmin7276120678738699352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7276120678738699352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12231836522951058275.hoa' '--buchi-type=spotba'
LTSmin run took 228 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-04 finished in 13069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)&&p1))&&p1)))'
Support contains 45 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 4 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:30:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:11] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
[2022-05-15 03:30:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:11] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-15 03:30:11] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:11] [INFO ] Implicit Places using invariants and state equation in 151 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 216 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s19 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-06 finished in 511 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 22 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 63 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 61 transition count 544
Applied a total of 9 rules in 36 ms. Remains 61 /66 variables (removed 5) and now considering 544/548 (removed 4) transitions.
[2022-05-15 03:30:11] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 61 cols
[2022-05-15 03:30:11] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 03:30:11] [INFO ] Implicit Places using invariants in 80 ms returned []
[2022-05-15 03:30:11] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 61 cols
[2022-05-15 03:30:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 03:30:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:12] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 268 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 544/548 transitions.
Applied a total of 0 rules in 26 ms. Remains 59 /59 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/66 places, 544/548 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s28 1) (GEQ s47 1)) (AND (GEQ s33 1) (GEQ s47 1)) (AND (GEQ s35 1) (GEQ s47 1)) (AND (GEQ s40 1) (GEQ s47 1)) (AND (GEQ s38 1) (GEQ s47 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-07 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&F(p1))))'
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 5 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:30:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:12] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
[2022-05-15 03:30:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:12] [INFO ] Implicit Places using invariants in 81 ms returned []
[2022-05-15 03:30:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:12] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:12] [INFO ] Implicit Places using invariants and state equation in 230 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 314 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/66 places, 547/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s12 1) (GEQ s25 1) (GEQ s26 1) (GEQ s62 1)), p0:(AND (GEQ s48 1) (GEQ s59 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-08 finished in 866 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||p1))))'
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 22 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:30:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:13] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-15 03:30:13] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
[2022-05-15 03:30:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:13] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-15 03:30:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:13] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 03:30:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:13] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s12 1)), p1:(AND (GEQ s7 1) (GEQ s22 1) (GEQ s24 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1237 reset in 304 ms.
Product exploration explored 100000 steps with 1289 reset in 295 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 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 (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 91 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-15 03:30:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 03:30:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 03:30:15] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-15 03:30:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 03:30:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 03:30:15] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-05-15 03:30:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 79 ms returned sat
[2022-05-15 03:30:15] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 28 ms.
[2022-05-15 03:30:15] [INFO ] Added : 19 causal constraints over 5 iterations in 108 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:30:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 03:30:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:15] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
[2022-05-15 03:30:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 03:30:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:15] [INFO ] Implicit Places using invariants in 83 ms returned []
[2022-05-15 03:30:15] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 03:30:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:16] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2022-05-15 03:30:16] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 03:30:16] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:16] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 219 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-15 03:30:17] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 03:30:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 03:30:17] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-15 03:30:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 03:30:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 03:30:17] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-15 03:30:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 80 ms returned sat
[2022-05-15 03:30:17] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 17 ms.
[2022-05-15 03:30:17] [INFO ] Added : 19 causal constraints over 5 iterations in 80 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1296 reset in 292 ms.
Product exploration explored 100000 steps with 1303 reset in 294 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 24 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 03:30:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 03:30:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:18] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
[2022-05-15 03:30:18] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 03:30:18] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 03:30:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:18] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Product exploration explored 100000 steps with 1244 reset in 291 ms.
Product exploration explored 100000 steps with 1284 reset in 300 ms.
Built C files in :
/tmp/ltsmin900944280871244123
[2022-05-15 03:30:19] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin900944280871244123
Running compilation step : cd /tmp/ltsmin900944280871244123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 992 ms.
Running link step : cd /tmp/ltsmin900944280871244123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin900944280871244123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15573032670179267212.hoa' '--buchi-type=spotba'
LTSmin run took 464 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-09 finished in 7851 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(X(F(X(X(p0)))))))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 63 transition count 546
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 61 transition count 544
Applied a total of 9 rules in 34 ms. Remains 61 /66 variables (removed 5) and now considering 544/548 (removed 4) transitions.
[2022-05-15 03:30:20] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 61 cols
[2022-05-15 03:30:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:30:21] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-15 03:30:21] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 61 cols
[2022-05-15 03:30:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 03:30:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:21] [INFO ] Implicit Places using invariants and state equation in 215 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 312 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/66 places, 544/548 transitions.
Applied a total of 0 rules in 20 ms. Remains 59 /59 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/66 places, 544/548 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s38 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-10 finished in 464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 3 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:30:21] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:21] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
[2022-05-15 03:30:21] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:21] [INFO ] Implicit Places using invariants in 108 ms returned []
[2022-05-15 03:30:21] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:30:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:21] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 322 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s22 1) (LT s24 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 132 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-11 finished in 622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G((X(((X(p1)&&p1)||p2))||p0))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:21] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:30:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:22] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
[2022-05-15 03:30:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:30:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:22] [INFO ] Implicit Places using invariants in 98 ms returned []
[2022-05-15 03:30:22] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:30:22] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:22] [INFO ] Implicit Places using invariants and state equation in 254 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 355 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 548/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 548/548 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s8 1)), p2:(LT s49 1), p1:(GEQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1345 reset in 255 ms.
Product exploration explored 100000 steps with 1413 reset in 259 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 513 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:30:24] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:24] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:24] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:24] [INFO ] After 31ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:24] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-15 03:30:24] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:24] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:24] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:24] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 730937 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 730937 steps, saw 177701 distinct states, run finished after 3002 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:30:27] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:27] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:27] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:27] [INFO ] After 31ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:27] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-15 03:30:27] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:28] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2022-05-15 03:30:28] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:28] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2022-05-15 03:30:28] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 03:30:28] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:28] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 5 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 61 cols
[2022-05-15 03:30:28] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:28] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:28] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:28] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 03:30:28] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:28] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-05-15 03:30:28] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:28] [INFO ] Flatten gal took : 12 ms
[2022-05-15 03:30:28] [INFO ] Flatten gal took : 8 ms
[2022-05-15 03:30:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10569913334838872131.gal : 2 ms
[2022-05-15 03:30:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality87916770802628487.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10075456971122331047;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10569913334838872131.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality87916770802628487.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality87916770802628487.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 420
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :420 after 2352
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2352 after 15288
Reachability property apf5 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :15288 after 162834
Reachability property apf3 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,233478,0.126006,6484,2,2513,15,13648,6,0,375,7331,0
Total reachable state count : 233478

Verifying 2 reachability properties.
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1764,0.129265,6484,2,195,15,13648,7,0,405,7331,0
Reachability property apf5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,36708,0.132867,6748,2,699,15,13648,8,0,411,7331,0
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (NOT (OR p0 p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 497 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), false, false, false]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:29] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
[2022-05-15 03:30:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:30] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-15 03:30:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:30] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2022-05-15 03:30:30] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 03:30:30] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:30:30] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/64 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 927 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:30:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:31] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:31] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:31] [INFO ] After 26ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:31] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-15 03:30:31] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:32] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 685315 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685315 steps, saw 167401 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-15 03:30:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:35] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 03:30:35] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:35] [INFO ] After 25ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:35] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-15 03:30:35] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:35] [INFO ] Implicit Places using invariants in 105 ms returned []
[2022-05-15 03:30:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:35] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2022-05-15 03:30:35] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-15 03:30:35] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:36] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 64 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 422 place count 62 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 62 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 61 transition count 127
Applied a total of 424 rules in 8 ms. Remains 61 /64 variables (removed 3) and now considering 127/548 (removed 421) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 61 cols
[2022-05-15 03:30:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 03:30:36] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:36] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 03:30:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 03:30:36] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 03:30:36] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:36] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 03:30:36] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 03:30:36] [INFO ] Flatten gal took : 9 ms
[2022-05-15 03:30:36] [INFO ] Flatten gal took : 6 ms
[2022-05-15 03:30:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18019259631052339504.gal : 1 ms
[2022-05-15 03:30:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality391697868133520996.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3120244197867912519;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18019259631052339504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality391697868133520996.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality391697868133520996.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 420
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :420 after 2352
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2352 after 15288
Reachability property apf5 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :15288 after 162834
Reachability property apf3 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,233478,0.087942,6420,2,2513,15,13648,6,0,375,7331,0
Total reachable state count : 233478

Verifying 2 reachability properties.
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,1764,0.091624,6684,2,195,15,13648,7,0,405,7331,0
Reachability property apf5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,36708,0.095305,6684,2,699,15,13648,8,0,411,7331,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (F (NOT (OR p0 p2 p1))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 20 factoid took 967 ms. Reduced automaton from 4 states, 12 edges and 3 AP to 4 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1578 reset in 294 ms.
Product exploration explored 100000 steps with 1532 reset in 316 ms.
Built C files in :
/tmp/ltsmin9046814980314010372
[2022-05-15 03:30:38] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 03:30:38] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:38] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 03:30:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:38] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 03:30:38] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:38] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9046814980314010372
Running compilation step : cd /tmp/ltsmin9046814980314010372;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1705 ms.
Running link step : cd /tmp/ltsmin9046814980314010372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9046814980314010372;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased39496874734208038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 548/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:30:53] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:53] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 03:30:53] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
[2022-05-15 03:30:53] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:53] [INFO ] Implicit Places using invariants in 103 ms returned []
[2022-05-15 03:30:53] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:30:54] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2022-05-15 03:30:54] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-15 03:30:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 64 cols
[2022-05-15 03:30:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:30:54] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 548/548 transitions.
Built C files in :
/tmp/ltsmin11931670581551341630
[2022-05-15 03:30:54] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 03:30:54] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:54] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 03:30:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:54] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 03:30:54] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:30:54] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11931670581551341630
Running compilation step : cd /tmp/ltsmin11931670581551341630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1632 ms.
Running link step : cd /tmp/ltsmin11931670581551341630;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11931670581551341630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7355604103386274025.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 03:31:09] [INFO ] Flatten gal took : 23 ms
[2022-05-15 03:31:09] [INFO ] Flatten gal took : 22 ms
[2022-05-15 03:31:09] [INFO ] Time to serialize gal into /tmp/LTL6565042507143757446.gal : 4 ms
[2022-05-15 03:31:09] [INFO ] Time to serialize properties into /tmp/LTL7278834792112968104.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6565042507143757446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7278834792112968104.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6565042...266
Read 1 LTL properties
Checking formula 0 : !((G(F(X(G(((X(((X("(SUR_PONT_A>=1)"))&&("(SUR_PONT_A>=1)"))||("(SUR_PONT_B<1)")))||("(ROUTE_A<1)"))||("(NB_ATTENTE_A_7<1)")))))))
Formula 0 simplified : !GFXG("(NB_ATTENTE_A_7<1)" | "(ROUTE_A<1)" | X("(SUR_PONT_B<1)" | ("(SUR_PONT_A>=1)" & X"(SUR_PONT_A>=1)")))
Detected timeout of ITS tools.
[2022-05-15 03:31:24] [INFO ] Flatten gal took : 28 ms
[2022-05-15 03:31:24] [INFO ] Applying decomposition
[2022-05-15 03:31:24] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10797150285976217905.txt' '-o' '/tmp/graph10797150285976217905.bin' '-w' '/tmp/graph10797150285976217905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10797150285976217905.bin' '-l' '-1' '-v' '-w' '/tmp/graph10797150285976217905.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:31:24] [INFO ] Decomposing Gal with order
[2022-05-15 03:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:31:24] [INFO ] Removed a total of 1081 redundant transitions.
[2022-05-15 03:31:24] [INFO ] Flatten gal took : 124 ms
[2022-05-15 03:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 6 ms.
[2022-05-15 03:31:24] [INFO ] Time to serialize gal into /tmp/LTL9283951779573995668.gal : 2 ms
[2022-05-15 03:31:24] [INFO ] Time to serialize properties into /tmp/LTL12122085785013884792.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9283951779573995668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12122085785013884792.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9283951...246
Read 1 LTL properties
Checking formula 0 : !((G(F(X(G(((X(((X("(i0.u3.SUR_PONT_A>=1)"))&&("(i0.u3.SUR_PONT_A>=1)"))||("(i0.u3.SUR_PONT_B<1)")))||("(i0.u1.ROUTE_A<1)"))||("(i0.u4...181
Formula 0 simplified : !GFXG("(i0.u1.ROUTE_A<1)" | "(i0.u4.NB_ATTENTE_A_7<1)" | X("(i0.u3.SUR_PONT_B<1)" | ("(i0.u3.SUR_PONT_A>=1)" & X"(i0.u3.SUR_PONT_A>=...161
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15793128367499202173
[2022-05-15 03:31:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15793128367499202173
Running compilation step : cd /tmp/ltsmin15793128367499202173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 957 ms.
Running link step : cd /tmp/ltsmin15793128367499202173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15793128367499202173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X([]((X(((X((LTLAPp1==true))&&(LTLAPp1==true))||(LTLAPp2==true)))||(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-12 finished in 92976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 23 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:31:54] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:31:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:31:55] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
[2022-05-15 03:31:55] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:31:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:31:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2022-05-15 03:31:55] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:31:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:31:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:31:55] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 269 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s23 1) (GEQ s25 1) (GEQ s42 1) (GEQ s47 1)), p0:(AND (GEQ s1 1) (GEQ s24 1) (GEQ s31 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-13 finished in 643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 03:31:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:31:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:31:55] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
[2022-05-15 03:31:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:31:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:31:55] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-15 03:31:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 03:31:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:31:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:31:56] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 348 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/66 places, 548/548 transitions.
Applied a total of 0 rules in 7 ms. Remains 64 /64 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 548/548 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-14 finished in 645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 547
Applied a total of 2 rules in 17 ms. Remains 65 /66 variables (removed 1) and now considering 547/548 (removed 1) transitions.
[2022-05-15 03:31:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:31:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:31:56] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
[2022-05-15 03:31:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:31:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 03:31:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2022-05-15 03:31:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 03:31:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 03:31:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 03:31:56] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 297 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/66 places, 547/548 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/66 places, 547/548 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s25 1) (GEQ s42 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 485 steps with 4 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N10-LTLFireability-15 finished in 612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((G(p1)&&p0))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G((X(((X(p1)&&p1)||p2))||p0))))))'
[2022-05-15 03:31:57] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4807434968653886678
[2022-05-15 03:31:57] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 03:31:57] [INFO ] Applying decomposition
[2022-05-15 03:31:57] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:31:57] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 03:31:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:31:57] [INFO ] Flatten gal took : 27 ms
[2022-05-15 03:31:57] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 03:31:57] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 03:31:57] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4807434968653886678
Running compilation step : cd /tmp/ltsmin4807434968653886678;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8901511174090760667.txt' '-o' '/tmp/graph8901511174090760667.bin' '-w' '/tmp/graph8901511174090760667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8901511174090760667.bin' '-l' '-1' '-v' '-w' '/tmp/graph8901511174090760667.weights' '-q' '0' '-e' '0.001'
[2022-05-15 03:31:57] [INFO ] Decomposing Gal with order
[2022-05-15 03:31:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 03:31:57] [INFO ] Removed a total of 659 redundant transitions.
[2022-05-15 03:31:57] [INFO ] Flatten gal took : 68 ms
[2022-05-15 03:31:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 4 ms.
[2022-05-15 03:31:57] [INFO ] Time to serialize gal into /tmp/LTLFireability15693746751719384853.gal : 3 ms
[2022-05-15 03:31:57] [INFO ] Time to serialize properties into /tmp/LTLFireability13493045429937407606.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15693746751719384853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13493045429937407606.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !((F(G(F(G(((G("(((((((i0.u1.CHOIX_1<1)||(u3.COMPTEUR_9<1))&&((i0.u1.CHOIX_1<1)||(u3.COMPTEUR_7<1)))&&(((i0.u1.CHOIX_1<1)||(u3.COMPTEU...976
Formula 0 simplified : !FGFG("((i0.u1.CAPACITE<20)||(i2.u4.VIDANGE_2<1))" & "((i0.u1.CAPACITE<20)||(u3.VIDANGE_1<1))" & G"(((((((i0.u1.CHOIX_1<1)||(u3.COMP...960
Compilation finished in 1706 ms.
Running link step : cd /tmp/ltsmin4807434968653886678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4807434968653886678;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>([](([]((LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t42, t43, t45, t80, t86, t146, t153, t245, t252, u3.t328, u3.t329, u3.t330, u3.t331, u3.t...1948
Computing Next relation with stutter on 20 deadlock states
Detected timeout of ITS tools.
[2022-05-15 03:53:06] [INFO ] Flatten gal took : 53 ms
[2022-05-15 03:53:06] [INFO ] Time to serialize gal into /tmp/LTLFireability10576596660267523544.gal : 21 ms
[2022-05-15 03:53:06] [INFO ] Time to serialize properties into /tmp/LTLFireability11729586027763548813.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10576596660267523544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11729586027763548813.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 2 LTL properties
Checking formula 0 : !((F(G(F(G(((G("(((((((CHOIX_1<1)||(COMPTEUR_9<1))&&((CHOIX_1<1)||(COMPTEUR_7<1)))&&(((CHOIX_1<1)||(COMPTEUR_8<1))&&((CHOIX_1<1)||(COM...775
Formula 0 simplified : !FGFG("((CAPACITE<20)||(VIDANGE_1<1))" & "((CAPACITE<20)||(VIDANGE_2<1))" & G"(((((((CHOIX_1<1)||(COMPTEUR_9<1))&&((CHOIX_1<1)||(COM...759
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin4807434968653886678;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>([](([]((LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4807434968653886678;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X([]((X(((X((LTLAPp3==true))&&(LTLAPp3==true))||(LTLAPp4==true)))||(LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 77331 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin4807434968653886678;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>([](([]((LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 04:14:16] [INFO ] Flatten gal took : 45 ms
[2022-05-15 04:14:16] [INFO ] Input system was already deterministic with 548 transitions.
[2022-05-15 04:14:16] [INFO ] Transformed 66 places.
[2022-05-15 04:14:16] [INFO ] Transformed 548 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 04:14:16] [INFO ] Time to serialize gal into /tmp/LTLFireability7299051962276124118.gal : 2 ms
[2022-05-15 04:14:16] [INFO ] Time to serialize properties into /tmp/LTLFireability12127583318516621354.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7299051962276124118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12127583318516621354.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(F(G(((G("(((((((CHOIX_1<1)||(COMPTEUR_9<1))&&((CHOIX_1<1)||(COMPTEUR_7<1)))&&(((CHOIX_1<1)||(COMPTEUR_8<1))&&((CHOIX_1<1)||(COM...775
Formula 0 simplified : !FGFG("((CAPACITE<20)||(VIDANGE_1<1))" & "((CAPACITE<20)||(VIDANGE_2<1))" & G"(((((((CHOIX_1<1)||(COMPTEUR_9<1))&&((CHOIX_1<1)||(COM...759
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t42, t43, t44, t45, t86, t87, t89, t90, t91, t92, t93, t94, t95, t96, t97, t98, t100...2532
Computing Next relation with stutter on 20 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V20P20N10, 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 r024-tall-165251918200204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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