About the Execution of ITS-Tools for DES-PT-60a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3989.479 | 1343627.00 | 2866107.00 | 3781.20 | TFTFFFFFFFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475400491.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DES-PT-60a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400491
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 110K Mar 5 18:22 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-60a-LTLCardinality-00
FORMULA_NAME DES-PT-60a-LTLCardinality-01
FORMULA_NAME DES-PT-60a-LTLCardinality-02
FORMULA_NAME DES-PT-60a-LTLCardinality-03
FORMULA_NAME DES-PT-60a-LTLCardinality-04
FORMULA_NAME DES-PT-60a-LTLCardinality-05
FORMULA_NAME DES-PT-60a-LTLCardinality-06
FORMULA_NAME DES-PT-60a-LTLCardinality-07
FORMULA_NAME DES-PT-60a-LTLCardinality-08
FORMULA_NAME DES-PT-60a-LTLCardinality-09
FORMULA_NAME DES-PT-60a-LTLCardinality-10
FORMULA_NAME DES-PT-60a-LTLCardinality-11
FORMULA_NAME DES-PT-60a-LTLCardinality-12
FORMULA_NAME DES-PT-60a-LTLCardinality-13
FORMULA_NAME DES-PT-60a-LTLCardinality-14
FORMULA_NAME DES-PT-60a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678279883182
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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 12:51:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 12:51:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:51:25] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-08 12:51:25] [INFO ] Transformed 354 places.
[2023-03-08 12:51:25] [INFO ] Transformed 311 transitions.
[2023-03-08 12:51:25] [INFO ] Found NUPN structural information;
[2023-03-08 12:51:25] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-60a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 353 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 353 transition count 296
Applied a total of 2 rules in 79 ms. Remains 353 /354 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 353 cols
[2023-03-08 12:51:25] [INFO ] Computed 59 place invariants in 73 ms
[2023-03-08 12:51:25] [INFO ] Implicit Places using invariants in 480 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 352/354 places, 296/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 597 ms. Remains : 352/354 places, 296/297 transitions.
Support contains 23 out of 352 places after structural reductions.
[2023-03-08 12:51:25] [INFO ] Flatten gal took : 62 ms
[2023-03-08 12:51:25] [INFO ] Flatten gal took : 27 ms
[2023-03-08 12:51:26] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 12:51:26] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 12:51:26] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 12:51:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 12:51:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 68 ms returned sat
[2023-03-08 12:51:27] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 12:51:27] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 30 ms to minimize.
[2023-03-08 12:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-08 12:51:28] [INFO ] After 921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-08 12:51:28] [INFO ] After 1527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 3941 steps, including 6 resets, run visited all 5 properties in 48 ms. (steps per millisecond=82 )
Parikh walk visited 5 properties in 132 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G((p1||G(p2))))))'
Support contains 7 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:51:28] [INFO ] Invariant cache hit.
[2023-03-08 12:51:29] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-08 12:51:29] [INFO ] Invariant cache hit.
[2023-03-08 12:51:29] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2023-03-08 12:51:29] [INFO ] Invariant cache hit.
[2023-03-08 12:51:29] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1084 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-60a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s268 0) (EQ s280 1)), p0:(EQ s308 1), p2:(OR (AND (EQ s263 0) (EQ s10 1)) (AND (EQ s245 0) (EQ s26 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]]
Product exploration explored 100000 steps with 2404 reset in 347 ms.
Product exploration explored 100000 steps with 2391 reset in 328 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 626 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 621 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2023-03-08 12:51:32] [INFO ] Invariant cache hit.
[2023-03-08 12:51:32] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 12:51:32] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-08 12:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:51:42] [INFO ] [Real]Absence check using state equation in 10029 ms returned sat
[2023-03-08 12:51:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:51:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2023-03-08 12:51:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 116 ms returned sat
[2023-03-08 12:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:51:44] [INFO ] [Nat]Absence check using state equation in 1833 ms returned sat
[2023-03-08 12:51:44] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 5 ms to minimize.
[2023-03-08 12:51:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-08 12:51:44] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 20 ms.
[2023-03-08 12:51:46] [INFO ] Added : 164 causal constraints over 33 iterations in 1951 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 352 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 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 23 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:51:46] [INFO ] Invariant cache hit.
[2023-03-08 12:51:47] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-08 12:51:47] [INFO ] Invariant cache hit.
[2023-03-08 12:51:47] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-03-08 12:51:47] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 12:51:47] [INFO ] Invariant cache hit.
[2023-03-08 12:51:47] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 973 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2023-03-08 12:51:48] [INFO ] Invariant cache hit.
[2023-03-08 12:51:48] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 12:51:48] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 28 ms returned sat
[2023-03-08 12:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:51:58] [INFO ] [Real]Absence check using state equation in 9947 ms returned sat
[2023-03-08 12:51:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:51:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 12:51:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 107 ms returned sat
[2023-03-08 12:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:52:00] [INFO ] [Nat]Absence check using state equation in 1876 ms returned sat
[2023-03-08 12:52:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
[2023-03-08 12:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-08 12:52:00] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-08 12:52:02] [INFO ] Added : 164 causal constraints over 33 iterations in 1902 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4600 reset in 246 ms.
Product exploration explored 100000 steps with 4573 reset in 254 ms.
Built C files in :
/tmp/ltsmin6496320331320348907
[2023-03-08 12:52:03] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2023-03-08 12:52:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:52:03] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2023-03-08 12:52:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:52:03] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2023-03-08 12:52:03] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:52:03] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6496320331320348907
Running compilation step : cd /tmp/ltsmin6496320331320348907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 733 ms.
Running link step : cd /tmp/ltsmin6496320331320348907;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6496320331320348907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15910845007090419381.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:52:18] [INFO ] Invariant cache hit.
[2023-03-08 12:52:18] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-08 12:52:18] [INFO ] Invariant cache hit.
[2023-03-08 12:52:19] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-08 12:52:19] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 12:52:19] [INFO ] Invariant cache hit.
[2023-03-08 12:52:19] [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 878 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin792115426194635586
[2023-03-08 12:52:19] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2023-03-08 12:52:19] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:52:19] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2023-03-08 12:52:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:52:19] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2023-03-08 12:52:19] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:52:19] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin792115426194635586
Running compilation step : cd /tmp/ltsmin792115426194635586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 619 ms.
Running link step : cd /tmp/ltsmin792115426194635586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin792115426194635586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13911111252013767604.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:52:34] [INFO ] Flatten gal took : 25 ms
[2023-03-08 12:52:34] [INFO ] Flatten gal took : 23 ms
[2023-03-08 12:52:34] [INFO ] Time to serialize gal into /tmp/LTL11113788090318453934.gal : 5 ms
[2023-03-08 12:52:34] [INFO ] Time to serialize properties into /tmp/LTL6431884728158481487.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11113788090318453934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10429616183727088218.hoa' '-atoms' '/tmp/LTL6431884728158481487.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6431884728158481487.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10429616183727088218.hoa
Detected timeout of ITS tools.
[2023-03-08 12:52:49] [INFO ] Flatten gal took : 19 ms
[2023-03-08 12:52:49] [INFO ] Flatten gal took : 19 ms
[2023-03-08 12:52:49] [INFO ] Time to serialize gal into /tmp/LTL18386130906120516269.gal : 9 ms
[2023-03-08 12:52:49] [INFO ] Time to serialize properties into /tmp/LTL5596071193663627122.ltl : 11 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18386130906120516269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5596071193663627122.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(p309==1)")))||(G(("((p269==0)&&(p281==1))")||(G("(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))")))))))
Formula 0 simplified : X(FG!"(p309==1)" & F(!"((p269==0)&&(p281==1))" & F!"(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))"))
Detected timeout of ITS tools.
[2023-03-08 12:53:04] [INFO ] Flatten gal took : 18 ms
[2023-03-08 12:53:04] [INFO ] Applying decomposition
[2023-03-08 12:53:04] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18161917756245657351.txt' '-o' '/tmp/graph18161917756245657351.bin' '-w' '/tmp/graph18161917756245657351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18161917756245657351.bin' '-l' '-1' '-v' '-w' '/tmp/graph18161917756245657351.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:53:05] [INFO ] Decomposing Gal with order
[2023-03-08 12:53:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:53:05] [INFO ] Removed a total of 66 redundant transitions.
[2023-03-08 12:53:05] [INFO ] Flatten gal took : 112 ms
[2023-03-08 12:53:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 22 ms.
[2023-03-08 12:53:05] [INFO ] Time to serialize gal into /tmp/LTL7968521673263748142.gal : 5 ms
[2023-03-08 12:53:05] [INFO ] Time to serialize properties into /tmp/LTL725245649978380731.ltl : 11 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7968521673263748142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL725245649978380731.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i7.i1.u33.p309==1)")))||(G(("((u13.p269==0)&&(i4.u19.p281==1))")||(G("(((i1.i0.u10.p264==0)&&(i3.u15.p10==1))||((u2.p245==...184
Formula 0 simplified : X(FG!"(i7.i1.u33.p309==1)" & F(!"((u13.p269==0)&&(i4.u19.p281==1))" & F!"(((i1.i0.u10.p264==0)&&(i3.u15.p10==1))||((u2.p245==0)&&(i3...172
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16063168574326049272
[2023-03-08 12:53:20] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16063168574326049272
Running compilation step : cd /tmp/ltsmin16063168574326049272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 485 ms.
Running link step : cd /tmp/ltsmin16063168574326049272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16063168574326049272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLCardinality-02 finished in 126887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p1))||p0) U X(p2)))'
Support contains 6 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 6 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:53:35] [INFO ] Invariant cache hit.
[2023-03-08 12:53:35] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-08 12:53:35] [INFO ] Invariant cache hit.
[2023-03-08 12:53:36] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2023-03-08 12:53:36] [INFO ] Invariant cache hit.
[2023-03-08 12:53:36] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 779 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s310 0) (EQ s34 1) (EQ s239 0) (EQ s136 1) (EQ s237 1)), p2:(EQ s291 1), p1:(EQ s237 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-03 finished in 973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 19 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 12:53:36] [INFO ] Computed 58 place invariants in 12 ms
[2023-03-08 12:53:36] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 12:53:36] [INFO ] Invariant cache hit.
[2023-03-08 12:53:37] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-08 12:53:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 12:53:37] [INFO ] Invariant cache hit.
[2023-03-08 12:53:37] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 928 ms. Remains : 351/352 places, 295/296 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-04 finished in 989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 4 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 12:53:37] [INFO ] Computed 58 place invariants in 12 ms
[2023-03-08 12:53:37] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-08 12:53:37] [INFO ] Invariant cache hit.
[2023-03-08 12:53:38] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-08 12:53:38] [INFO ] Invariant cache hit.
[2023-03-08 12:53:38] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 811 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-60a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s251 0) (EQ s87 1)), p1:(OR (EQ s343 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-07 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 9 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:53:38] [INFO ] Invariant cache hit.
[2023-03-08 12:53:38] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 12:53:38] [INFO ] Invariant cache hit.
[2023-03-08 12:53:39] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2023-03-08 12:53:39] [INFO ] Invariant cache hit.
[2023-03-08 12:53:39] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-08 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:(EQ s203 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-60a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-08 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:53:39] [INFO ] Invariant cache hit.
[2023-03-08 12:53:39] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-08 12:53:39] [INFO ] Invariant cache hit.
[2023-03-08 12:53:40] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-08 12:53:40] [INFO ] Invariant cache hit.
[2023-03-08 12:53:40] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s278 0) (NEQ s251 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][false, false]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-60a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-09 finished in 857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:53:40] [INFO ] Invariant cache hit.
[2023-03-08 12:53:40] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 12:53:40] [INFO ] Invariant cache hit.
[2023-03-08 12:53:40] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-08 12:53:40] [INFO ] Invariant cache hit.
[2023-03-08 12:53:41] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 720 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s191 0) (EQ s245 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-10 finished in 904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:53:41] [INFO ] Invariant cache hit.
[2023-03-08 12:53:41] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 12:53:41] [INFO ] Invariant cache hit.
[2023-03-08 12:53:41] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-08 12:53:41] [INFO ] Invariant cache hit.
[2023-03-08 12:53:42] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 774 ms. Remains : 352/352 places, 296/296 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s73 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][false, false, false]]
Product exploration explored 100000 steps with 2236 reset in 201 ms.
Product exploration explored 100000 steps with 2247 reset in 237 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1493052 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :{}
Probabilistic random walk after 1493052 steps, saw 208262 distinct states, run finished after 3002 ms. (steps per millisecond=497 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:53:45] [INFO ] Invariant cache hit.
[2023-03-08 12:53:45] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:53:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 12:53:46] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-08 12:53:46] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:53:46] [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 19 ms.
[2023-03-08 12:53:46] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 351 transition count 293
Applied a total of 9 rules in 42 ms. Remains 351 /352 variables (removed 1) and now considering 293/296 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 351/352 places, 293/296 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1501766 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :{}
Probabilistic random walk after 1501766 steps, saw 209660 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 12:53:49] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 12:53:49] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:53:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:53:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 121 ms returned sat
[2023-03-08 12:53:50] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:53:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:53:50] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:53:50] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 12:53:50] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2397 steps, including 2 resets, run visited all 1 properties in 12 ms. (steps per millisecond=199 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 12:53:50] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 12:53:50] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-08 12:53:50] [INFO ] Invariant cache hit.
[2023-03-08 12:53:51] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2023-03-08 12:53:51] [INFO ] Invariant cache hit.
[2023-03-08 12:53:51] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 815 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Detected a total of 255/352 stabilizing places and 250/296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1542745 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :{}
Probabilistic random walk after 1542745 steps, saw 214313 distinct states, run finished after 3001 ms. (steps per millisecond=514 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:53:54] [INFO ] Invariant cache hit.
[2023-03-08 12:53:54] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:53:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:53:54] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2023-03-08 12:53:55] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:53:55] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-08 12:53:55] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 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 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 351 transition count 293
Applied a total of 9 rules in 57 ms. Remains 351 /352 variables (removed 1) and now considering 293/296 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 351/352 places, 293/296 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1528570 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :{}
Probabilistic random walk after 1528570 steps, saw 213853 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 12:53:58] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-08 12:53:58] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:53:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:53:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 125 ms returned sat
[2023-03-08 12:53:58] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:53:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 12:53:58] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:53:58] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 12:53:58] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2428 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=220 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2228 reset in 224 ms.
Product exploration explored 100000 steps with 2223 reset in 235 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 32 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:54:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 12:54:00] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 12:54:00] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin791941968775283861
[2023-03-08 12:54:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin791941968775283861
Running compilation step : cd /tmp/ltsmin791941968775283861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 506 ms.
Running link step : cd /tmp/ltsmin791941968775283861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin791941968775283861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased260163387467175128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:54:15] [INFO ] Invariant cache hit.
[2023-03-08 12:54:15] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-08 12:54:15] [INFO ] Invariant cache hit.
[2023-03-08 12:54:16] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-08 12:54:16] [INFO ] Invariant cache hit.
[2023-03-08 12:54:16] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 763 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin4460695383587019171
[2023-03-08 12:54:16] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4460695383587019171
Running compilation step : cd /tmp/ltsmin4460695383587019171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 513 ms.
Running link step : cd /tmp/ltsmin4460695383587019171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4460695383587019171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10077978923863858536.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:54:31] [INFO ] Flatten gal took : 36 ms
[2023-03-08 12:54:31] [INFO ] Flatten gal took : 19 ms
[2023-03-08 12:54:31] [INFO ] Time to serialize gal into /tmp/LTL3190218686307218658.gal : 2 ms
[2023-03-08 12:54:31] [INFO ] Time to serialize properties into /tmp/LTL3380881598198347270.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3190218686307218658.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3558492010461673773.hoa' '-atoms' '/tmp/LTL3380881598198347270.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3380881598198347270.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3558492010461673773.hoa
Detected timeout of ITS tools.
[2023-03-08 12:54:46] [INFO ] Flatten gal took : 15 ms
[2023-03-08 12:54:46] [INFO ] Flatten gal took : 12 ms
[2023-03-08 12:54:46] [INFO ] Time to serialize gal into /tmp/LTL10092220959372049066.gal : 2 ms
[2023-03-08 12:54:46] [INFO ] Time to serialize properties into /tmp/LTL4688230932898841669.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10092220959372049066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4688230932898841669.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(p73==0)"))))
Formula 0 simplified : XF!"(p73==0)"
Detected timeout of ITS tools.
[2023-03-08 12:55:01] [INFO ] Flatten gal took : 21 ms
[2023-03-08 12:55:01] [INFO ] Applying decomposition
[2023-03-08 12:55:01] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4455998797375089477.txt' '-o' '/tmp/graph4455998797375089477.bin' '-w' '/tmp/graph4455998797375089477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4455998797375089477.bin' '-l' '-1' '-v' '-w' '/tmp/graph4455998797375089477.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:55:01] [INFO ] Decomposing Gal with order
[2023-03-08 12:55:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:55:01] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 12:55:01] [INFO ] Flatten gal took : 19 ms
[2023-03-08 12:55:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2023-03-08 12:55:01] [INFO ] Time to serialize gal into /tmp/LTL17386651481320625912.gal : 3 ms
[2023-03-08 12:55:01] [INFO ] Time to serialize properties into /tmp/LTL10963302230775277757.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17386651481320625912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10963302230775277757.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G("(u48.p73==0)"))))
Formula 0 simplified : XF!"(u48.p73==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10146930691587204770
[2023-03-08 12:55:16] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10146930691587204770
Running compilation step : cd /tmp/ltsmin10146930691587204770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 477 ms.
Running link step : cd /tmp/ltsmin10146930691587204770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin10146930691587204770;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLCardinality-11 finished in 110560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 16 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 12:55:31] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 12:55:32] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 12:55:32] [INFO ] Invariant cache hit.
[2023-03-08 12:55:32] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2023-03-08 12:55:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:55:32] [INFO ] Invariant cache hit.
[2023-03-08 12:55:32] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 743 ms. Remains : 351/352 places, 295/296 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s310 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA DES-PT-60a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60a-LTLCardinality-13 finished in 800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G((p1||G(p2))))))'
Found a Lengthening insensitive property : DES-PT-60a-LTLCardinality-02
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 352 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 14 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 352 cols
[2023-03-08 12:55:32] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 12:55:33] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 12:55:33] [INFO ] Invariant cache hit.
[2023-03-08 12:55:33] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2023-03-08 12:55:33] [INFO ] Invariant cache hit.
[2023-03-08 12:55:33] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 737 ms. Remains : 352/352 places, 296/296 transitions.
Running random walk in product with property : DES-PT-60a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s268 0) (EQ s280 1)), p0:(EQ s308 1), p2:(OR (AND (EQ s263 0) (EQ s10 1)) (AND (EQ s245 0) (EQ s26 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2410 reset in 195 ms.
Product exploration explored 100000 steps with 2400 reset in 227 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 600 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 482 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2023-03-08 12:55:35] [INFO ] Invariant cache hit.
[2023-03-08 12:55:35] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 12:55:35] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 28 ms returned sat
[2023-03-08 12:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:55:45] [INFO ] [Real]Absence check using state equation in 9922 ms returned sat
[2023-03-08 12:55:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:55:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 12:55:45] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 110 ms returned sat
[2023-03-08 12:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:55:47] [INFO ] [Nat]Absence check using state equation in 1852 ms returned sat
[2023-03-08 12:55:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-08 12:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 12:55:47] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-08 12:55:49] [INFO ] Added : 164 causal constraints over 33 iterations in 1861 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 352 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 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 16 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:55:49] [INFO ] Invariant cache hit.
[2023-03-08 12:55:49] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 12:55:49] [INFO ] Invariant cache hit.
[2023-03-08 12:55:50] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2023-03-08 12:55:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:55:50] [INFO ] Invariant cache hit.
[2023-03-08 12:55:50] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 743 ms. Remains : 352/352 places, 296/296 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-08 12:55:50] [INFO ] Invariant cache hit.
[2023-03-08 12:55:51] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 12:55:51] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 31 ms returned sat
[2023-03-08 12:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:56:00] [INFO ] [Real]Absence check using state equation in 9895 ms returned sat
[2023-03-08 12:56:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:56:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 12:56:01] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 108 ms returned sat
[2023-03-08 12:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:56:03] [INFO ] [Nat]Absence check using state equation in 1855 ms returned sat
[2023-03-08 12:56:03] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-08 12:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-03-08 12:56:03] [INFO ] Computed and/alt/rep : 288/864/288 causal constraints (skipped 7 transitions) in 20 ms.
[2023-03-08 12:56:05] [INFO ] Added : 164 causal constraints over 33 iterations in 1851 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4575 reset in 216 ms.
Product exploration explored 100000 steps with 4635 reset in 233 ms.
Built C files in :
/tmp/ltsmin6169384433882531677
[2023-03-08 12:56:05] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2023-03-08 12:56:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:56:05] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2023-03-08 12:56:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:56:05] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2023-03-08 12:56:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:56:05] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6169384433882531677
Running compilation step : cd /tmp/ltsmin6169384433882531677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 635 ms.
Running link step : cd /tmp/ltsmin6169384433882531677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6169384433882531677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6513707746127612093.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Applied a total of 0 rules in 18 ms. Remains 352 /352 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-08 12:56:20] [INFO ] Invariant cache hit.
[2023-03-08 12:56:20] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 12:56:20] [INFO ] Invariant cache hit.
[2023-03-08 12:56:21] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-08 12:56:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:56:21] [INFO ] Invariant cache hit.
[2023-03-08 12:56:21] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 718 ms. Remains : 352/352 places, 296/296 transitions.
Built C files in :
/tmp/ltsmin5476718324669198610
[2023-03-08 12:56:21] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2023-03-08 12:56:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:56:21] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2023-03-08 12:56:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:56:21] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2023-03-08 12:56:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:56:21] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5476718324669198610
Running compilation step : cd /tmp/ltsmin5476718324669198610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 628 ms.
Running link step : cd /tmp/ltsmin5476718324669198610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5476718324669198610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16695455924035669000.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:56:36] [INFO ] Flatten gal took : 15 ms
[2023-03-08 12:56:36] [INFO ] Flatten gal took : 17 ms
[2023-03-08 12:56:36] [INFO ] Time to serialize gal into /tmp/LTL14669864759198155622.gal : 3 ms
[2023-03-08 12:56:36] [INFO ] Time to serialize properties into /tmp/LTL16849809170417332366.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14669864759198155622.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10013147297331462683.hoa' '-atoms' '/tmp/LTL16849809170417332366.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16849809170417332366.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10013147297331462683.hoa
Detected timeout of ITS tools.
[2023-03-08 12:56:51] [INFO ] Flatten gal took : 16 ms
[2023-03-08 12:56:51] [INFO ] Flatten gal took : 11 ms
[2023-03-08 12:56:51] [INFO ] Time to serialize gal into /tmp/LTL5596785727471891924.gal : 2 ms
[2023-03-08 12:56:51] [INFO ] Time to serialize properties into /tmp/LTL17275754205877631040.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5596785727471891924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17275754205877631040.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(p309==1)")))||(G(("((p269==0)&&(p281==1))")||(G("(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))")))))))
Formula 0 simplified : X(FG!"(p309==1)" & F(!"((p269==0)&&(p281==1))" & F!"(((p264==0)&&(p10==1))||((p245==0)&&(p26==1)))"))
Detected timeout of ITS tools.
[2023-03-08 12:57:06] [INFO ] Flatten gal took : 12 ms
[2023-03-08 12:57:06] [INFO ] Applying decomposition
[2023-03-08 12:57:06] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph7146986516213794731.txt' '-o' '/tmp/graph7146986516213794731.bin' '-w' '/tmp/graph7146986516213794731.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7146986516213794731.bin' '-l' '-1' '-v' '-w' '/tmp/graph7146986516213794731.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:57:06] [INFO ] Decomposing Gal with order
[2023-03-08 12:57:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:57:06] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 12:57:06] [INFO ] Flatten gal took : 17 ms
[2023-03-08 12:57:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-08 12:57:06] [INFO ] Time to serialize gal into /tmp/LTL14526272259013716241.gal : 4 ms
[2023-03-08 12:57:06] [INFO ] Time to serialize properties into /tmp/LTL3214380499884097035.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14526272259013716241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3214380499884097035.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i4.i3.u32.p309==1)")))||(G(("((u13.p269==0)&&(i4.i2.u18.p281==1))")||(G("(((i0.i0.u10.p264==0)&&(u14.p10==1))||((u2.p245==...181
Formula 0 simplified : X(FG!"(i4.i3.u32.p309==1)" & F(!"((u13.p269==0)&&(i4.i2.u18.p281==1))" & F!"(((i0.i0.u10.p264==0)&&(u14.p10==1))||((u2.p245==0)&&(u1...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5636400206820328411
[2023-03-08 12:57:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5636400206820328411
Running compilation step : cd /tmp/ltsmin5636400206820328411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 484 ms.
Running link step : cd /tmp/ltsmin5636400206820328411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin5636400206820328411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLCardinality-02 finished in 124427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : DES-PT-60a-LTLCardinality-11
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 352/352 places, 296/296 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 15 ms. Remains 351 /352 variables (removed 1) and now considering 295/296 (removed 1) transitions.
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 12:57:37] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 12:57:37] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-08 12:57:37] [INFO ] Invariant cache hit.
[2023-03-08 12:57:37] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2023-03-08 12:57:37] [INFO ] Invariant cache hit.
[2023-03-08 12:57:37] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 754 ms. Remains : 351/352 places, 295/296 transitions.
Running random walk in product with property : DES-PT-60a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s72 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2279 reset in 189 ms.
Product exploration explored 100000 steps with 2305 reset in 201 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 238 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1561699 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :{}
Probabilistic random walk after 1561699 steps, saw 216493 distinct states, run finished after 3003 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:57:41] [INFO ] Invariant cache hit.
[2023-03-08 12:57:41] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:57:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:57:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 83 ms returned sat
[2023-03-08 12:57:42] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:57:42] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 12:57:42] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 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 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 19 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/351 places, 293/295 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1556514 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :{}
Probabilistic random walk after 1556514 steps, saw 218760 distinct states, run finished after 3001 ms. (steps per millisecond=518 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 12:57:45] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 12:57:45] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:57:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 12:57:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 141 ms returned sat
[2023-03-08 12:57:46] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:57:46] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-08 12:57:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-08 12:57:46] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 12:57:46] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 12:57:46] [INFO ] Invariant cache hit.
[2023-03-08 12:57:46] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-08 12:57:46] [INFO ] Invariant cache hit.
[2023-03-08 12:57:46] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-08 12:57:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:57:46] [INFO ] Invariant cache hit.
[2023-03-08 12:57:47] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 795 ms. Remains : 351/351 places, 293/293 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 351 transition count 293
Applied a total of 1 rules in 29 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 12:57:47] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 12:57:47] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:57:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:57:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 132 ms returned sat
[2023-03-08 12:57:47] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:57:47] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 12:57:47] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 12:57:48] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 12:57:48] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-08 12:57:48] [INFO ] Invariant cache hit.
[2023-03-08 12:57:48] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-08 12:57:48] [INFO ] Invariant cache hit.
[2023-03-08 12:57:48] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 810 ms. Remains : 351/351 places, 295/295 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Detected a total of 254/351 stabilizing places and 249/295 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 221 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 50 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1553005 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :{}
Probabilistic random walk after 1553005 steps, saw 215507 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:57:52] [INFO ] Invariant cache hit.
[2023-03-08 12:57:52] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:57:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 12:57:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 76 ms returned sat
[2023-03-08 12:57:52] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:57:52] [INFO ] After 463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 12:57:52] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 295/295 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 351 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 351 transition count 293
Applied a total of 4 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/295 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 351/351 places, 293/295 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1516033 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :{}
Probabilistic random walk after 1516033 steps, saw 213247 distinct states, run finished after 3001 ms. (steps per millisecond=505 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 12:57:56] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 12:57:56] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:57:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:57:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 134 ms returned sat
[2023-03-08 12:57:56] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:57:56] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-08 12:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-08 12:57:56] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 12:57:56] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-08 12:57:56] [INFO ] Invariant cache hit.
[2023-03-08 12:57:57] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-08 12:57:57] [INFO ] Invariant cache hit.
[2023-03-08 12:57:57] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-08 12:57:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:57:57] [INFO ] Invariant cache hit.
[2023-03-08 12:57:57] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 878 ms. Remains : 351/351 places, 293/293 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 351 transition count 293
Applied a total of 1 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-08 12:57:57] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 12:57:57] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:57:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:57:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 133 ms returned sat
[2023-03-08 12:57:58] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:57:58] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 12:57:58] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2265 reset in 180 ms.
Product exploration explored 100000 steps with 2281 reset in 202 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-08 12:57:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 295 rows 351 cols
[2023-03-08 12:57:59] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 12:57:59] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 351/351 places, 295/295 transitions.
Built C files in :
/tmp/ltsmin15760027722791593420
[2023-03-08 12:57:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15760027722791593420
Running compilation step : cd /tmp/ltsmin15760027722791593420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 485 ms.
Running link step : cd /tmp/ltsmin15760027722791593420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin15760027722791593420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4624050996673293796.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 351/351 places, 295/295 transitions.
Applied a total of 0 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-08 12:58:14] [INFO ] Invariant cache hit.
[2023-03-08 12:58:14] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 12:58:14] [INFO ] Invariant cache hit.
[2023-03-08 12:58:15] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-08 12:58:15] [INFO ] Invariant cache hit.
[2023-03-08 12:58:15] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 351/351 places, 295/295 transitions.
Built C files in :
/tmp/ltsmin10827273308419324848
[2023-03-08 12:58:15] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10827273308419324848
Running compilation step : cd /tmp/ltsmin10827273308419324848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 481 ms.
Running link step : cd /tmp/ltsmin10827273308419324848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10827273308419324848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6307248992503201580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:58:30] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:58:30] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:58:30] [INFO ] Time to serialize gal into /tmp/LTL16863018181579363051.gal : 2 ms
[2023-03-08 12:58:30] [INFO ] Time to serialize properties into /tmp/LTL9526764415355366462.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16863018181579363051.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14853972451442372677.hoa' '-atoms' '/tmp/LTL9526764415355366462.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9526764415355366462.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14853972451442372677.hoa
Detected timeout of ITS tools.
[2023-03-08 12:58:45] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:58:45] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:58:45] [INFO ] Time to serialize gal into /tmp/LTL8608110758068572743.gal : 1 ms
[2023-03-08 12:58:45] [INFO ] Time to serialize properties into /tmp/LTL4966148612388980125.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8608110758068572743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4966148612388980125.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("(p73==0)"))))
Formula 0 simplified : XF!"(p73==0)"
Detected timeout of ITS tools.
[2023-03-08 12:59:00] [INFO ] Flatten gal took : 14 ms
[2023-03-08 12:59:00] [INFO ] Applying decomposition
[2023-03-08 12:59:00] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9460099926567713077.txt' '-o' '/tmp/graph9460099926567713077.bin' '-w' '/tmp/graph9460099926567713077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9460099926567713077.bin' '-l' '-1' '-v' '-w' '/tmp/graph9460099926567713077.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:59:00] [INFO ] Decomposing Gal with order
[2023-03-08 12:59:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:59:00] [INFO ] Removed a total of 11 redundant transitions.
[2023-03-08 12:59:00] [INFO ] Flatten gal took : 33 ms
[2023-03-08 12:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-08 12:59:00] [INFO ] Time to serialize gal into /tmp/LTL10639660139277604833.gal : 2 ms
[2023-03-08 12:59:00] [INFO ] Time to serialize properties into /tmp/LTL14751935650882759262.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10639660139277604833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14751935650882759262.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G("(u48.p73==0)"))))
Formula 0 simplified : XF!"(u48.p73==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10951645783539062995
[2023-03-08 12:59:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10951645783539062995
Running compilation step : cd /tmp/ltsmin10951645783539062995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 477 ms.
Running link step : cd /tmp/ltsmin10951645783539062995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10951645783539062995;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60a-LTLCardinality-11 finished in 114052 ms.
[2023-03-08 12:59:31] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18240632308604785538
[2023-03-08 12:59:31] [INFO ] Applying decomposition
[2023-03-08 12:59:31] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2023-03-08 12:59:31] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:59:31] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2023-03-08 12:59:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:59:31] [INFO ] Flatten gal took : 12 ms
[2023-03-08 12:59:31] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2023-03-08 12:59:31] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:59:31] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18240632308604785538
Running compilation step : cd /tmp/ltsmin18240632308604785538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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.202303021504/bin/convert-linux64' '-i' '/tmp/graph16523634354687573068.txt' '-o' '/tmp/graph16523634354687573068.bin' '-w' '/tmp/graph16523634354687573068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16523634354687573068.bin' '-l' '-1' '-v' '-w' '/tmp/graph16523634354687573068.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:59:31] [INFO ] Decomposing Gal with order
[2023-03-08 12:59:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:59:31] [INFO ] Removed a total of 65 redundant transitions.
[2023-03-08 12:59:31] [INFO ] Flatten gal took : 58 ms
[2023-03-08 12:59:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 21 ms.
[2023-03-08 12:59:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality7704230141693418791.gal : 19 ms
[2023-03-08 12:59:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality6665544728320120806.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7704230141693418791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6665544728320120806.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X((G(F("(i8.u32.p309==1)")))||(G(("((u12.p269==0)&&(i6.i2.u18.p281==1))")||(G("(((i0.i0.u9.p264==0)&&(i3.u13.p10==1))||((u2.p245==0...183
Formula 0 simplified : X(FG!"(i8.u32.p309==1)" & F(!"((u12.p269==0)&&(i6.i2.u18.p281==1))" & F!"(((i0.i0.u9.p264==0)&&(i3.u13.p10==1))||((u2.p245==0)&&(i3....171
Compilation finished in 800 ms.
Running link step : cd /tmp/ltsmin18240632308604785538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18240632308604785538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t256, t257, t289, u2.t8, u2.t130, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u...838
Computing Next relation with stutter on 8.35188e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.050: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.648: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.648: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.648: LTL layer: formula: X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))
pins2lts-mc-linux64( 0/ 8), 0.648: "X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.648: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.659: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.665: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.666: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.668: buchi has 5 states
pins2lts-mc-linux64( 3/ 8), 0.673: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.675: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.680: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.700: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.799: DFS-FIFO for weak LTL, using special progress label 301
pins2lts-mc-linux64( 0/ 8), 0.799: There are 302 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.799: State length is 353, there are 307 groups
pins2lts-mc-linux64( 0/ 8), 0.799: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.799: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.799: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.799: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 1.270: ~1 levels ~960 states ~6248 transitions
pins2lts-mc-linux64( 3/ 8), 1.386: ~1 levels ~1920 states ~12352 transitions
pins2lts-mc-linux64( 3/ 8), 1.561: ~1 levels ~3840 states ~23856 transitions
pins2lts-mc-linux64( 0/ 8), 1.804: ~1 levels ~7680 states ~41056 transitions
pins2lts-mc-linux64( 3/ 8), 2.109: ~1 levels ~15360 states ~92192 transitions
pins2lts-mc-linux64( 2/ 8), 2.968: ~1 levels ~30720 states ~192328 transitions
pins2lts-mc-linux64( 4/ 8), 5.313: ~1 levels ~61440 states ~369784 transitions
pins2lts-mc-linux64( 1/ 8), 8.346: ~64 levels ~122880 states ~468168 transitions
pins2lts-mc-linux64( 1/ 8), 12.891: ~67 levels ~245760 states ~859800 transitions
pins2lts-mc-linux64( 0/ 8), 21.625: ~58 levels ~491520 states ~2143976 transitions
pins2lts-mc-linux64( 0/ 8), 31.839: ~58 levels ~983040 states ~3922416 transitions
pins2lts-mc-linux64( 0/ 8), 45.534: ~58 levels ~1966080 states ~7321736 transitions
pins2lts-mc-linux64( 2/ 8), 60.779: ~70 levels ~3932160 states ~14409680 transitions
pins2lts-mc-linux64( 0/ 8), 91.234: ~58 levels ~7864320 states ~29834680 transitions
pins2lts-mc-linux64( 0/ 8), 153.631: ~58 levels ~15728640 states ~62218704 transitions
pins2lts-mc-linux64( 6/ 8), 294.274: ~68 levels ~31457280 states ~121489512 transitions
pins2lts-mc-linux64( 6/ 8), 320.485: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 320.527:
pins2lts-mc-linux64( 0/ 8), 320.528: mean standard work distribution: 2.0% (states) 3.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 320.528:
pins2lts-mc-linux64( 0/ 8), 320.528: Explored 32858196 states 135816209 transitions, fanout: 4.133
pins2lts-mc-linux64( 0/ 8), 320.528: Total exploration time 319.690 sec (319.640 sec minimum, 319.675 sec on average)
pins2lts-mc-linux64( 0/ 8), 320.528: States per second: 102781, Transitions per second: 424837
pins2lts-mc-linux64( 0/ 8), 320.528:
pins2lts-mc-linux64( 0/ 8), 320.528: Progress states detected: 186556
pins2lts-mc-linux64( 0/ 8), 320.528: Redundant explorations: -0.1223
pins2lts-mc-linux64( 0/ 8), 320.528:
pins2lts-mc-linux64( 0/ 8), 320.528: Queue width: 8B, total height: 77422, memory: 0.59MB
pins2lts-mc-linux64( 0/ 8), 320.528: Tree memory: 507.0MB, 16.2 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 320.528: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 320.528: Stored 298 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 320.528: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 320.528: Est. total memory use: 507.6MB (~1024.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18240632308604785538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18240632308604785538;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp0==true)))||[](((LTLAPp1==true)||[]((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
97 unique states visited
0 strongly connected components in search stack
116 transitions explored
59 items max in DFS search stack
62536 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,625.408,2666500,1,0,7.75327e+06,234783,966,5.1143e+06,1852,1.95824e+06,4914780
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-60a-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G("(u48.p73==0)"))))
Formula 1 simplified : XF!"(u48.p73==0)"
Computing Next relation with stutter on 8.35188e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2533 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,650.736,2914652,1,0,8.33328e+06,234783,1102,6.08279e+06,2338,1.95824e+06,5570415
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DES-PT-60a-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1341088 ms.
BK_STOP 1678281226809
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-60a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475400491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;