Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208600458.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DES-PT-50a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208600458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716340332797

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 01:12:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 01:12:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:12:14] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-22 01:12:14] [INFO ] Transformed 314 places.
[2024-05-22 01:12:14] [INFO ] Transformed 271 transitions.
[2024-05-22 01:12:14] [INFO ] Found NUPN structural information;
[2024-05-22 01:12:14] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 38 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2024-05-22 01:12:14] [INFO ] Computed 59 invariants in 29 ms
[2024-05-22 01:12:15] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-22 01:12:15] [INFO ] Invariant cache hit.
[2024-05-22 01:12:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:12:15] [INFO ] Implicit Places using invariants and state equation in 439 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1045 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/314 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1101 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 44 out of 313 places after structural reductions.
[2024-05-22 01:12:15] [INFO ] Flatten gal took : 53 ms
[2024-05-22 01:12:15] [INFO ] Flatten gal took : 25 ms
[2024-05-22 01:12:15] [INFO ] Input system was already deterministic with 257 transitions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 28) seen :9
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 257 rows 313 cols
[2024-05-22 01:12:16] [INFO ] Computed 58 invariants in 10 ms
[2024-05-22 01:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 01:12:16] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-22 01:12:16] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-22 01:12:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 01:12:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 181 ms returned sat
[2024-05-22 01:12:26] [INFO ] After 7824ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2024-05-22 01:12:26] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 5 ms to minimize.
[2024-05-22 01:12:26] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-22 01:12:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2024-05-22 01:12:33] [INFO ] After 14859ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 8825 ms.
[2024-05-22 01:12:41] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 4 properties in 1504 ms.
Support contains 20 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 312 transition count 254
Applied a total of 8 rules in 59 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 581340 steps, run timeout after 3002 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 581340 steps, saw 83652 distinct states, run finished after 3003 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:12:47] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:12:47] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:12:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 01:12:47] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-22 01:12:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:12:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 129 ms returned sat
[2024-05-22 01:12:49] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-22 01:12:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:12:49] [INFO ] After 532ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-22 01:12:50] [INFO ] After 1202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 538 ms.
[2024-05-22 01:12:50] [INFO ] After 2842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 896 ms.
Support contains 20 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:12:51] [INFO ] Invariant cache hit.
[2024-05-22 01:12:51] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 01:12:51] [INFO ] Invariant cache hit.
[2024-05-22 01:12:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:12:52] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-22 01:12:52] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-22 01:12:52] [INFO ] Invariant cache hit.
[2024-05-22 01:12:52] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 14 properties.
[2024-05-22 01:12:52] [INFO ] Invariant cache hit.
[2024-05-22 01:12:52] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:12:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-22 01:12:52] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-22 01:12:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:12:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 174 ms returned sat
[2024-05-22 01:12:56] [INFO ] After 1373ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-22 01:12:58] [INFO ] After 3111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 3066 ms.
[2024-05-22 01:13:01] [INFO ] After 9139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA DES-PT-50a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 216 stabilizing places and 211 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G(p0))) U p1)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 20 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 01:13:01] [INFO ] Computed 58 invariants in 6 ms
[2024-05-22 01:13:02] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 01:13:02] [INFO ] Invariant cache hit.
[2024-05-22 01:13:02] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2024-05-22 01:13:02] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-22 01:13:02] [INFO ] Invariant cache hit.
[2024-05-22 01:13:02] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 649 ms. Remains : 312/313 places, 256/257 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 136 ms :[(NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s101 1) (EQ s228 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 39 steps with 0 reset in 3 ms.
FORMULA DES-PT-50a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-00 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 21 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:13:02] [INFO ] Invariant cache hit.
[2024-05-22 01:13:02] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 01:13:02] [INFO ] Invariant cache hit.
[2024-05-22 01:13:03] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-22 01:13:03] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:13:03] [INFO ] Invariant cache hit.
[2024-05-22 01:13:03] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 645 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s154 1) (NEQ s204 1)), p0:(OR (NEQ s114 1) (NEQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2225 reset in 299 ms.
Product exploration explored 100000 steps with 2247 reset in 260 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1039435 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1039435 steps, saw 148149 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:13:07] [INFO ] Invariant cache hit.
[2024-05-22 01:13:07] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:13:07] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-22 01:13:07] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:13:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2024-05-22 01:13:07] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2024-05-22 01:13:07] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:13:08] [INFO ] After 350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-22 01:13:08] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 57 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1097084 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{}
Probabilistic random walk after 1097084 steps, saw 153529 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:13:11] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 01:13:11] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 01:13:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:13:11] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:13:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:13:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2024-05-22 01:13:11] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:13:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:13:11] [INFO ] After 114ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:13:12] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-22 01:13:12] [INFO ] After 746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 76 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:13:12] [INFO ] Invariant cache hit.
[2024-05-22 01:13:12] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 01:13:12] [INFO ] Invariant cache hit.
[2024-05-22 01:13:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:13:12] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-22 01:13:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:13:12] [INFO ] Invariant cache hit.
[2024-05-22 01:13:12] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 674 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 01:13:12] [INFO ] Invariant cache hit.
[2024-05-22 01:13:12] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:13:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 01:13:12] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:13:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:13:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 102 ms returned sat
[2024-05-22 01:13:13] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:13:13] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-22 01:13:13] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 01:13:13] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:13:14] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 01:13:14] [INFO ] Invariant cache hit.
[2024-05-22 01:13:14] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2024-05-22 01:13:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:13:14] [INFO ] Invariant cache hit.
[2024-05-22 01:13:14] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 673 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 211 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1103266 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{}
Probabilistic random walk after 1103266 steps, saw 157065 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:13:18] [INFO ] Invariant cache hit.
[2024-05-22 01:13:18] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:13:18] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-22 01:13:18] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:13:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:13:18] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 44 ms returned sat
[2024-05-22 01:13:18] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:13:18] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-22 01:13:18] [INFO ] After 550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 17 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1105999 steps, run timeout after 3001 ms. (steps per millisecond=368 ) properties seen :{}
Probabilistic random walk after 1105999 steps, saw 154718 distinct states, run finished after 3002 ms. (steps per millisecond=368 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:13:21] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:13:21] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:13:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2024-05-22 01:13:21] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:13:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:13:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2024-05-22 01:13:22] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:13:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:13:22] [INFO ] After 114ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:13:22] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-22 01:13:22] [INFO ] After 746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 64 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:13:22] [INFO ] Invariant cache hit.
[2024-05-22 01:13:22] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 01:13:22] [INFO ] Invariant cache hit.
[2024-05-22 01:13:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:13:23] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-22 01:13:23] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:13:23] [INFO ] Invariant cache hit.
[2024-05-22 01:13:23] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 01:13:23] [INFO ] Invariant cache hit.
[2024-05-22 01:13:23] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:13:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-22 01:13:23] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:13:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:13:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 102 ms returned sat
[2024-05-22 01:13:24] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:13:24] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2024-05-22 01:13:24] [INFO ] After 655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2218 reset in 208 ms.
Product exploration explored 100000 steps with 2218 reset in 232 ms.
Built C files in :
/tmp/ltsmin12648502042947109908
[2024-05-22 01:13:25] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-22 01:13:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:25] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-22 01:13:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:25] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-22 01:13:25] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:25] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12648502042947109908
Running compilation step : cd /tmp/ltsmin12648502042947109908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 666 ms.
Running link step : cd /tmp/ltsmin12648502042947109908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12648502042947109908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12613548779505020717.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 01:13:40] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 01:13:40] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 01:13:40] [INFO ] Invariant cache hit.
[2024-05-22 01:13:40] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-22 01:13:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:13:40] [INFO ] Invariant cache hit.
[2024-05-22 01:13:40] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 665 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin17349913988336871778
[2024-05-22 01:13:40] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-22 01:13:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:40] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-22 01:13:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:40] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-22 01:13:40] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:13:40] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17349913988336871778
Running compilation step : cd /tmp/ltsmin17349913988336871778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 533 ms.
Running link step : cd /tmp/ltsmin17349913988336871778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17349913988336871778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15078820432142914645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:13:56] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:13:56] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:13:56] [INFO ] Time to serialize gal into /tmp/LTL11299263530957402810.gal : 4 ms
[2024-05-22 01:13:56] [INFO ] Time to serialize properties into /tmp/LTL6073678368217886822.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11299263530957402810.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12104171523369037600.hoa' '-atoms' '/tmp/LTL6073678368217886822.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6073678368217886822.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12104171523369037600.hoa
Detected timeout of ITS tools.
[2024-05-22 01:14:11] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:14:11] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:14:11] [INFO ] Time to serialize gal into /tmp/LTL1464026473182117020.gal : 3 ms
[2024-05-22 01:14:11] [INFO ] Time to serialize properties into /tmp/LTL12791979744873481688.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1464026473182117020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12791979744873481688.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p114!=1)||(p229!=1))")||(G("((p154!=1)||(p204!=1))"))))))
Formula 0 simplified : G(F!"((p154!=1)||(p204!=1))" & FG!"((p114!=1)||(p229!=1))")
Detected timeout of ITS tools.
[2024-05-22 01:14:26] [INFO ] Flatten gal took : 21 ms
[2024-05-22 01:14:26] [INFO ] Applying decomposition
[2024-05-22 01:14:26] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12691526433788853068.txt' '-o' '/tmp/graph12691526433788853068.bin' '-w' '/tmp/graph12691526433788853068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12691526433788853068.bin' '-l' '-1' '-v' '-w' '/tmp/graph12691526433788853068.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:14:26] [INFO ] Decomposing Gal with order
[2024-05-22 01:14:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:14:26] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-22 01:14:26] [INFO ] Flatten gal took : 48 ms
[2024-05-22 01:14:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 7 ms.
[2024-05-22 01:14:26] [INFO ] Time to serialize gal into /tmp/LTL16674642358184832342.gal : 4 ms
[2024-05-22 01:14:26] [INFO ] Time to serialize properties into /tmp/LTL3740734512895880125.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16674642358184832342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3740734512895880125.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u13.p114!=1)||(u13.p229!=1))")||(G("((u2.p154!=1)||(u2.p204!=1))"))))))
Formula 0 simplified : G(F!"((u2.p154!=1)||(u2.p204!=1))" & FG!"((u13.p114!=1)||(u13.p229!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8125037719448646192
[2024-05-22 01:14:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8125037719448646192
Running compilation step : cd /tmp/ltsmin8125037719448646192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 438 ms.
Running link step : cd /tmp/ltsmin8125037719448646192;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8125037719448646192;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 DES-PT-50a-LTLFireability-01 finished in 113896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G(p1)))))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 12 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:14:56] [INFO ] Invariant cache hit.
[2024-05-22 01:14:56] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 01:14:56] [INFO ] Invariant cache hit.
[2024-05-22 01:14:57] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-22 01:14:57] [INFO ] Invariant cache hit.
[2024-05-22 01:14:57] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s185 1) (EQ s204 1)), p1:(OR (EQ s14 0) (EQ s231 0) (EQ s233 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2204 reset in 298 ms.
Product exploration explored 100000 steps with 2223 reset in 249 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 928643 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 928643 steps, saw 134812 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:15:01] [INFO ] Invariant cache hit.
[2024-05-22 01:15:01] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:15:01] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-22 01:15:01] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:15:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:15:01] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 108 ms returned sat
[2024-05-22 01:15:12] [INFO ] After 10999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:15:23] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1115 ms
[2024-05-22 01:15:24] [INFO ] After 22912ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2024-05-22 01:15:24] [INFO ] After 23278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 47 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 878716 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 878716 steps, saw 125204 distinct states, run finished after 3002 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:15:28] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:15:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:15:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2024-05-22 01:15:28] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:15:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:15:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2024-05-22 01:15:28] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:15:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:15:28] [INFO ] After 88ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:15:28] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-22 01:15:28] [INFO ] After 732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:15:29] [INFO ] Invariant cache hit.
[2024-05-22 01:15:29] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 01:15:29] [INFO ] Invariant cache hit.
[2024-05-22 01:15:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:15:29] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2024-05-22 01:15:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:15:29] [INFO ] Invariant cache hit.
[2024-05-22 01:15:29] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 22 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:15:29] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 01:15:29] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 01:15:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:15:29] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:15:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:15:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2024-05-22 01:15:30] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:15:30] [INFO ] After 403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2024-05-22 01:15:30] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 01:15:30] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 01:15:31] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 01:15:31] [INFO ] Invariant cache hit.
[2024-05-22 01:15:31] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-22 01:15:31] [INFO ] Invariant cache hit.
[2024-05-22 01:15:31] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 889858 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 889858 steps, saw 130625 distinct states, run finished after 3002 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:15:35] [INFO ] Invariant cache hit.
[2024-05-22 01:15:35] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:15:35] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-22 01:15:35] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:15:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 01:15:35] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 116 ms returned sat
[2024-05-22 01:15:46] [INFO ] After 10870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:15:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-22 01:15:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2024-05-22 01:15:57] [INFO ] After 21656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-22 01:15:57] [INFO ] After 21960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Applied a total of 7 rules in 22 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1071104 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1071104 steps, saw 150497 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:16:00] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 01:16:00] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:16:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:16:00] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:16:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:16:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2024-05-22 01:16:00] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:16:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:16:01] [INFO ] After 90ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 01:16:01] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-22 01:16:01] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 83 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:16:01] [INFO ] Invariant cache hit.
[2024-05-22 01:16:01] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 01:16:01] [INFO ] Invariant cache hit.
[2024-05-22 01:16:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:16:01] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-22 01:16:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:16:01] [INFO ] Invariant cache hit.
[2024-05-22 01:16:01] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:16:01] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:16:01] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:16:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2024-05-22 01:16:02] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:16:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:16:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2024-05-22 01:16:02] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:16:02] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-22 01:16:02] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2217 reset in 235 ms.
Product exploration explored 100000 steps with 2238 reset in 262 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 26 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-22 01:16:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 01:16:04] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:16:04] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin4378224169831972207
[2024-05-22 01:16:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4378224169831972207
Running compilation step : cd /tmp/ltsmin4378224169831972207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 461 ms.
Running link step : cd /tmp/ltsmin4378224169831972207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4378224169831972207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15903436583306257048.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-22 01:16:19] [INFO ] Invariant cache hit.
[2024-05-22 01:16:19] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 01:16:19] [INFO ] Invariant cache hit.
[2024-05-22 01:16:20] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-22 01:16:20] [INFO ] Invariant cache hit.
[2024-05-22 01:16:20] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 661 ms. Remains : 312/312 places, 256/256 transitions.
Built C files in :
/tmp/ltsmin14581981562809154603
[2024-05-22 01:16:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14581981562809154603
Running compilation step : cd /tmp/ltsmin14581981562809154603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 424 ms.
Running link step : cd /tmp/ltsmin14581981562809154603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin14581981562809154603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14311268350445631621.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:16:35] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:16:35] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:16:35] [INFO ] Time to serialize gal into /tmp/LTL2653083696286926383.gal : 2 ms
[2024-05-22 01:16:35] [INFO ] Time to serialize properties into /tmp/LTL15178592066459107453.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2653083696286926383.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7472547616530584874.hoa' '-atoms' '/tmp/LTL15178592066459107453.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15178592066459107453.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7472547616530584874.hoa
Detected timeout of ITS tools.
[2024-05-22 01:16:50] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:16:50] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:16:50] [INFO ] Time to serialize gal into /tmp/LTL4088347769843595490.gal : 2 ms
[2024-05-22 01:16:50] [INFO ] Time to serialize properties into /tmp/LTL7068556555808823624.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4088347769843595490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7068556555808823624.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(G("(((p14==0)||(p232==0))||(p234==0))")))||("((p185==1)&&(p204==1))"))))))
Formula 0 simplified : XXX(!"((p185==1)&&(p204==1))" & GF!"(((p14==0)||(p232==0))||(p234==0))")
Detected timeout of ITS tools.
[2024-05-22 01:17:05] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:17:05] [INFO ] Applying decomposition
[2024-05-22 01:17:05] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2490889524325455017.txt' '-o' '/tmp/graph2490889524325455017.bin' '-w' '/tmp/graph2490889524325455017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2490889524325455017.bin' '-l' '-1' '-v' '-w' '/tmp/graph2490889524325455017.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:17:05] [INFO ] Decomposing Gal with order
[2024-05-22 01:17:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:17:05] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:17:05] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:17:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 01:17:05] [INFO ] Time to serialize gal into /tmp/LTL13697668333299421467.gal : 4 ms
[2024-05-22 01:17:05] [INFO ] Time to serialize properties into /tmp/LTL10491558994519982774.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13697668333299421467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10491558994519982774.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(G("(((u13.p14==0)||(u13.p232==0))||(u13.p234==0))")))||("((u2.p185==1)&&(u2.p204==1))"))))))
Formula 0 simplified : XXX(!"((u2.p185==1)&&(u2.p204==1))" & GF!"(((u13.p14==0)||(u13.p232==0))||(u13.p234==0))")
Reverse transition relation is NOT exact ! Due to transitions t1, t216, t217, t250, u2.t8, u2.t110, u2.t114, u2.t115, u2.t116, u2.t117, u2.t118, u2.t119, u...752
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2025043692130291374
[2024-05-22 01:17:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2025043692130291374
Running compilation step : cd /tmp/ltsmin2025043692130291374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 445 ms.
Running link step : cd /tmp/ltsmin2025043692130291374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2025043692130291374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>([]((LTLAPp0==true)))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50a-LTLFireability-03 finished in 159136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:17:35] [INFO ] Invariant cache hit.
[2024-05-22 01:17:35] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 01:17:35] [INFO ] Invariant cache hit.
[2024-05-22 01:17:36] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-22 01:17:36] [INFO ] Invariant cache hit.
[2024-05-22 01:17:36] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s290 0) (EQ s295 0)), p1:(OR (AND (EQ s174 1) (EQ s204 1)) (AND (EQ s290 1) (EQ s295 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-04 finished in 882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 16 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:17:36] [INFO ] Invariant cache hit.
[2024-05-22 01:17:36] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 01:17:36] [INFO ] Invariant cache hit.
[2024-05-22 01:17:37] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-22 01:17:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:17:37] [INFO ] Invariant cache hit.
[2024-05-22 01:17:37] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s203 0) (EQ s222 0)), p1:(AND (EQ s10 1) (EQ s231 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-05 finished in 774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 17 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:17:37] [INFO ] Invariant cache hit.
[2024-05-22 01:17:37] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 01:17:37] [INFO ] Invariant cache hit.
[2024-05-22 01:17:37] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-22 01:17:37] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:17:37] [INFO ] Invariant cache hit.
[2024-05-22 01:17:38] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 633 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s220 1) (NEQ s225 1) (NEQ s227 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 2202 reset in 215 ms.
Product exploration explored 100000 steps with 2228 reset in 285 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 261 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=130 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-22 01:17:38] [INFO ] Invariant cache hit.
[2024-05-22 01:17:39] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 01:17:39] [INFO ] Invariant cache hit.
[2024-05-22 01:17:39] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-22 01:17:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 01:17:39] [INFO ] Invariant cache hit.
[2024-05-22 01:17:39] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 632 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2225 reset in 207 ms.
Product exploration explored 100000 steps with 2192 reset in 234 ms.
Built C files in :
/tmp/ltsmin14764071771317383362
[2024-05-22 01:17:40] [INFO ] Computing symmetric may disable matrix : 256 transitions.
[2024-05-22 01:17:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:17:40] [INFO ] Computing symmetric may enable matrix : 256 transitions.
[2024-05-22 01:17:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:17:40] [INFO ] Computing Do-Not-Accords matrix : 256 transitions.
[2024-05-22 01:17:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:17:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14764071771317383362
Running compilation step : cd /tmp/ltsmin14764071771317383362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 541 ms.
Running link step : cd /tmp/ltsmin14764071771317383362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14764071771317383362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13262668594202136783.hoa' '--buchi-type=spotba'
LTSmin run took 801 ms.
FORMULA DES-PT-50a-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50a-LTLFireability-06 finished in 4262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 11 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-22 01:17:41] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:17:41] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-22 01:17:41] [INFO ] Invariant cache hit.
[2024-05-22 01:17:42] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2024-05-22 01:17:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:17:42] [INFO ] Invariant cache hit.
[2024-05-22 01:17:42] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1273 ms. Remains : 313/313 places, 257/257 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s236 1) (EQ s305 1))) (NOT (AND (EQ s73 1) (EQ s308 1)))), p0:(AND (EQ s189 1) (EQ s204 1)), p1:(AND (EQ s73 1) (EQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2239 reset in 212 ms.
Product exploration explored 100000 steps with 2232 reset in 239 ms.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:17:43] [INFO ] Invariant cache hit.
[2024-05-22 01:17:43] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:17:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:17:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 88 ms returned sat
[2024-05-22 01:17:49] [INFO ] After 5457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:17:49] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-22 01:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2024-05-22 01:17:49] [INFO ] After 5698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-22 01:17:49] [INFO ] After 6015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 312 transition count 254
Applied a total of 9 rules in 18 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1423386 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :{}
Probabilistic random walk after 1423386 steps, saw 198827 distinct states, run finished after 3001 ms. (steps per millisecond=474 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:17:53] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 01:17:53] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:17:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:17:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-22 01:17:53] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:17:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:17:53] [INFO ] After 58ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:17:53] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-22 01:17:53] [INFO ] After 716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:17:53] [INFO ] Invariant cache hit.
[2024-05-22 01:17:53] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 01:17:53] [INFO ] Invariant cache hit.
[2024-05-22 01:17:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:17:54] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-05-22 01:17:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:17:54] [INFO ] Invariant cache hit.
[2024-05-22 01:17:54] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 620 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:17:54] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:17:54] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:17:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:17:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2024-05-22 01:17:54] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:17:55] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-22 01:17:55] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 9 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-22 01:17:55] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:17:55] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 01:17:55] [INFO ] Invariant cache hit.
[2024-05-22 01:17:56] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2024-05-22 01:17:56] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:17:56] [INFO ] Invariant cache hit.
[2024-05-22 01:17:56] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1288 ms. Remains : 313/313 places, 257/257 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:17:56] [INFO ] Invariant cache hit.
[2024-05-22 01:17:56] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:17:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:17:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 87 ms returned sat
[2024-05-22 01:18:02] [INFO ] After 5467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:18:02] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2024-05-22 01:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2024-05-22 01:18:02] [INFO ] After 5691ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-22 01:18:02] [INFO ] After 6010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 312 transition count 254
Applied a total of 9 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1449270 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :{}
Probabilistic random walk after 1449270 steps, saw 202286 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:18:06] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:18:06] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:18:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:18:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 60 ms returned sat
[2024-05-22 01:18:06] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:18:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:18:06] [INFO ] After 54ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:18:06] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-22 01:18:06] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 01:18:06] [INFO ] Invariant cache hit.
[2024-05-22 01:18:06] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 01:18:06] [INFO ] Invariant cache hit.
[2024-05-22 01:18:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:18:07] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-05-22 01:18:07] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:18:07] [INFO ] Invariant cache hit.
[2024-05-22 01:18:07] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 618 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2024-05-22 01:18:07] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 01:18:07] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:18:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:18:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2024-05-22 01:18:07] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:18:08] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-22 01:18:08] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 63 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2237 reset in 206 ms.
Product exploration explored 100000 steps with 2223 reset in 223 ms.
Built C files in :
/tmp/ltsmin71127666796856298
[2024-05-22 01:18:08] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-22 01:18:08] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:18:08] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-22 01:18:08] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:18:08] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-22 01:18:08] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:18:08] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin71127666796856298
Running compilation step : cd /tmp/ltsmin71127666796856298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 522 ms.
Running link step : cd /tmp/ltsmin71127666796856298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin71127666796856298;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2529012537721903437.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2024-05-22 01:18:23] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 01:18:24] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 01:18:24] [INFO ] Invariant cache hit.
[2024-05-22 01:18:25] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2024-05-22 01:18:25] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:18:25] [INFO ] Invariant cache hit.
[2024-05-22 01:18:25] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1309 ms. Remains : 313/313 places, 257/257 transitions.
Built C files in :
/tmp/ltsmin15677271164993450063
[2024-05-22 01:18:25] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-22 01:18:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:18:25] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-22 01:18:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:18:25] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-22 01:18:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:18:25] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15677271164993450063
Running compilation step : cd /tmp/ltsmin15677271164993450063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin15677271164993450063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15677271164993450063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15497748672045980456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:18:40] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:18:40] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:18:40] [INFO ] Time to serialize gal into /tmp/LTL14129362766667202299.gal : 3 ms
[2024-05-22 01:18:40] [INFO ] Time to serialize properties into /tmp/LTL17810950943203116499.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14129362766667202299.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8733924222774358377.hoa' '-atoms' '/tmp/LTL17810950943203116499.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17810950943203116499.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8733924222774358377.hoa
Detected timeout of ITS tools.
[2024-05-22 01:18:55] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:18:55] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:18:55] [INFO ] Time to serialize gal into /tmp/LTL14294472604606534198.gal : 2 ms
[2024-05-22 01:18:55] [INFO ] Time to serialize properties into /tmp/LTL2192424529961013067.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14294472604606534198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2192424529961013067.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((p73==1)&&(p309==1))"))U(("((!((p237==1)&&(p306==1)))&&(!((p73==1)&&(p309==1))))")||(G(!("((p73==1)&&(p309==1))")))))||("...183
Formula 0 simplified : FG(!"((p189==1)&&(p204==1))" & ("((p73==1)&&(p309==1))" M !"((!((p237==1)&&(p306==1)))&&(!((p73==1)&&(p309==1))))"))
Detected timeout of ITS tools.
[2024-05-22 01:19:10] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:19:10] [INFO ] Applying decomposition
[2024-05-22 01:19:10] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17050070741190949636.txt' '-o' '/tmp/graph17050070741190949636.bin' '-w' '/tmp/graph17050070741190949636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17050070741190949636.bin' '-l' '-1' '-v' '-w' '/tmp/graph17050070741190949636.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:19:10] [INFO ] Decomposing Gal with order
[2024-05-22 01:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:19:10] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-22 01:19:10] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:19:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2024-05-22 01:19:10] [INFO ] Time to serialize gal into /tmp/LTL3921732815407006596.gal : 3 ms
[2024-05-22 01:19:10] [INFO ] Time to serialize properties into /tmp/LTL14203945317436251861.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3921732815407006596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14203945317436251861.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((u48.p73==1)&&(u48.p309==1))"))U(("((!((i11.u17.p237==1)&&(i11.u46.p306==1)))&&(!((u48.p73==1)&&(u48.p309==1))))")||(G(!(...229
Formula 0 simplified : FG(!"((u2.p189==1)&&(u2.p204==1))" & ("((u48.p73==1)&&(u48.p309==1))" M !"((!((i11.u17.p237==1)&&(i11.u46.p306==1)))&&(!((u48.p73==1...177
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17319977723448689477
[2024-05-22 01:19:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17319977723448689477
Running compilation step : cd /tmp/ltsmin17319977723448689477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 417 ms.
Running link step : cd /tmp/ltsmin17319977723448689477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17319977723448689477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50a-LTLFireability-08 finished in 119160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 10 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2024-05-22 01:19:40] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 01:19:41] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 01:19:41] [INFO ] Invariant cache hit.
[2024-05-22 01:19:41] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-22 01:19:41] [INFO ] Invariant cache hit.
[2024-05-22 01:19:41] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s110 1) (EQ s228 1)), p0:(OR (EQ s18 0) (EQ s231 0) (EQ s233 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Product exploration explored 100000 steps with 50000 reset in 555 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-11 finished in 1880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X((X(G(p2))&&p1))))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 7 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:19:42] [INFO ] Invariant cache hit.
[2024-05-22 01:19:42] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 01:19:42] [INFO ] Invariant cache hit.
[2024-05-22 01:19:43] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2024-05-22 01:19:43] [INFO ] Invariant cache hit.
[2024-05-22 01:19:43] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DES-PT-50a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s136 1) (EQ s228 1)), p1:(AND (EQ s99 1) (EQ s307 1)), p2:(OR (EQ s136 0) (EQ s228 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-12 finished in 773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 5 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:19:43] [INFO ] Invariant cache hit.
[2024-05-22 01:19:43] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 01:19:43] [INFO ] Invariant cache hit.
[2024-05-22 01:19:43] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-22 01:19:43] [INFO ] Invariant cache hit.
[2024-05-22 01:19:44] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s205 1) (EQ s226 1) (EQ s98 1) (EQ s307 1)), p1:(OR (EQ s268 0) (EQ s284 0) (EQ s75 0) (EQ s307 0))], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2194 reset in 213 ms.
Product exploration explored 100000 steps with 2217 reset in 247 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 99 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1559437 steps, run timeout after 3001 ms. (steps per millisecond=519 ) properties seen :{}
Probabilistic random walk after 1559437 steps, saw 216245 distinct states, run finished after 3002 ms. (steps per millisecond=519 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:19:47] [INFO ] Invariant cache hit.
[2024-05-22 01:19:47] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:19:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:19:48] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 105 ms returned sat
[2024-05-22 01:19:48] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:19:48] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-22 01:19:48] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1387 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=346 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 13 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-13 finished in 5085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:19:48] [INFO ] Invariant cache hit.
[2024-05-22 01:19:48] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 01:19:48] [INFO ] Invariant cache hit.
[2024-05-22 01:19:49] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-22 01:19:49] [INFO ] Invariant cache hit.
[2024-05-22 01:19:49] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s3 1) (EQ s231 1) (EQ s233 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]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-14 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||p0) U (!p1 U (p2 U !p3)))))'
Support contains 9 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2024-05-22 01:19:49] [INFO ] Invariant cache hit.
[2024-05-22 01:19:49] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 01:19:49] [INFO ] Invariant cache hit.
[2024-05-22 01:19:49] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-22 01:19:49] [INFO ] Invariant cache hit.
[2024-05-22 01:19:50] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 226 ms :[p3, p3, (NOT p1), p3, (AND (NOT p1) p3), true, p3]
Running random walk in product with property : DES-PT-50a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p3 p2 p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p3 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=3 dest: 5}, { cond=(AND p3 p2 p1), acceptance={0} source=3 dest: 6}], [{ cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND p3 p2 p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p3 p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s112 1) (EQ s228 1)), p1:(AND (EQ s288 1) (EQ s291 1)), p0:(OR (AND (EQ s262 1) (EQ s278 1)) (AND (EQ s288 1) (EQ s291 1))), p2:(AND (EQ s7 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 558 ms.
Product exploration explored 100000 steps with 50000 reset in 557 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND p3 p1) (AND p3 p0)))), (X (NOT (AND p3 p2 p1 (NOT p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p3 p2 p1 p0)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (OR (AND p3 p1) (AND p3 p0))))), (X (X (NOT (AND p3 p2 p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 24 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-15 finished in 2013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(G(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U (p2||G(!p1)))))))'
[2024-05-22 01:19:51] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14225225561261911806
[2024-05-22 01:19:51] [INFO ] Applying decomposition
[2024-05-22 01:19:51] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-22 01:19:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:19:51] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-22 01:19:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:19:51] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:19:51] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-22 01:19:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:19:51] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14225225561261911806
Running compilation step : cd /tmp/ltsmin14225225561261911806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17720207773884419704.txt' '-o' '/tmp/graph17720207773884419704.bin' '-w' '/tmp/graph17720207773884419704.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17720207773884419704.bin' '-l' '-1' '-v' '-w' '/tmp/graph17720207773884419704.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:19:51] [INFO ] Decomposing Gal with order
[2024-05-22 01:19:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:19:51] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:19:51] [INFO ] Flatten gal took : 32 ms
[2024-05-22 01:19:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-22 01:19:51] [INFO ] Time to serialize gal into /tmp/LTLFireability11090970347162823650.gal : 3 ms
[2024-05-22 01:19:51] [INFO ] Time to serialize properties into /tmp/LTLFireability4526768277202049931.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11090970347162823650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4526768277202049931.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F(("((u12.p114!=1)||(u12.p229!=1))")||(G("((u2.p154!=1)||(u2.p204!=1))"))))))
Formula 0 simplified : G(F!"((u2.p154!=1)||(u2.p204!=1))" & FG!"((u12.p114!=1)||(u12.p229!=1))")
Compilation finished in 656 ms.
Running link step : cd /tmp/ltsmin14225225561261911806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14225225561261911806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 t1, t216, t217, t250, u2.t8, u2.t110, u2.t114, u2.t115, u2.t116, u2.t117, u2.t118, u2.t119, u...752
Computing Next relation with stutter on 6.30884e+06 deadlock states
60 unique states visited
0 strongly connected components in search stack
118 transitions explored
60 items max in DFS search stack
6416 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,64.2326,1278776,1,0,2.61102e+06,211731,2561,4.75296e+06,5574,1.35691e+06,2371032
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-50a-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(("((u2.p185==1)&&(u2.p204==1))")||(F(G("(((u13.p14==0)||(u13.p232==0))||(u13.p234==0))"))))))))
Formula 1 simplified : XXX(!"((u2.p185==1)&&(u2.p204==1))" & GF!"(((u13.p14==0)||(u13.p232==0))||(u13.p234==0))")
Computing Next relation with stutter on 6.30884e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
18734 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,251.575,2198816,1,0,4.96678e+06,220345,631,7.16922e+06,1499,1.43697e+06,1603579
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DES-PT-50a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(("((u2.p189==1)&&(u2.p204==1))")||((!("((u47.p73==1)&&(u47.p309==1))"))U(("((!((i10.u15.p237==1)&&(i10.u45.p306==1)))&&(!((u47....229
Formula 2 simplified : FG(!"((u2.p189==1)&&(u2.p204==1))" & ("((u47.p73==1)&&(u47.p309==1))" M !"((!((i10.u15.p237==1)&&(i10.u45.p306==1)))&&(!((u47.p73==1...177
Computing Next relation with stutter on 6.30884e+06 deadlock states
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
1763 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,269.217,2198944,1,0,4.96678e+06,220345,1020,7.16922e+06,2197,1.43697e+06,2024443
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DES-PT-50a-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1088812 ms.

BK_STOP 1716341424043

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-50a, 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 r109-tall-171624208600458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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