Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 16K Apr 29 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 29 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 29 19:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 139K Apr 29 19:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 9 08:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 9 08:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K May 9 08:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 208K May 10 09:34 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 LamportFastMutEx-PT-6-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-6-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652785796875

Running Version 202205111006
[2022-05-17 11:09:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 11:09:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 11:09:58] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-05-17 11:09:58] [INFO ] Transformed 217 places.
[2022-05-17 11:09:58] [INFO ] Transformed 420 transitions.
[2022-05-17 11:09:58] [INFO ] Found NUPN structural information;
[2022-05-17 11:09:58] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6]
[2022-05-17 11:09:58] [INFO ] Parsed PT model containing 217 places and 420 transitions in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 41 places in 4 ms
Reduce places removed 41 places and 66 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:09:58] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:09:58] [INFO ] Computed 50 place invariants in 14 ms
[2022-05-17 11:09:58] [INFO ] Implicit Places using invariants in 221 ms returned []
[2022-05-17 11:09:58] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:09:58] [INFO ] Computed 50 place invariants in 6 ms
[2022-05-17 11:09:58] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:09:58] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2022-05-17 11:09:58] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:09:58] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-17 11:09:59] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Support contains 136 out of 176 places after structural reductions.
[2022-05-17 11:09:59] [INFO ] Flatten gal took : 52 ms
[2022-05-17 11:09:59] [INFO ] Flatten gal took : 27 ms
[2022-05-17 11:09:59] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 22) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 11:10:00] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:00] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 11:10:00] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-6-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 6 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(p0)||p1)))))'
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 16 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:10:00] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:00] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-17 11:10:00] [INFO ] Implicit Places using invariants in 145 ms returned []
[2022-05-17 11:10:00] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:00] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 11:10:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:00] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2022-05-17 11:10:00] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:00] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 11:10:00] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (LEQ 2 (ADD s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 2 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-00 finished in 859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(G(p0))||p1) U (F((F(p0)&&p1))&&X(p2)))))'
Support contains 60 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:10:01] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:01] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:01] [INFO ] Implicit Places using invariants in 128 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 130 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s50 s51 s52 s53 s54 s55) (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s1...], 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]]
Product exploration explored 100000 steps with 13855 reset in 463 ms.
Product exploration explored 100000 steps with 13980 reset in 399 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 577 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Finished random walk after 1564 steps, including 0 resets, run visited all 7 properties in 14 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 719 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Support contains 60 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 25 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2022-05-17 11:10:04] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 11:10:04] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-17 11:10:04] [INFO ] Implicit Places using invariants in 104 ms returned []
[2022-05-17 11:10:04] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 11:10:04] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 11:10:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 11:10:04] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2022-05-17 11:10:04] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-17 11:10:04] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 11:10:04] [INFO ] Computed 44 place invariants in 3 ms
[2022-05-17 11:10:04] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/170 places, 348/354 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/170 places, 348/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 573 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Finished random walk after 504 steps, including 0 resets, run visited all 7 properties in 4 ms. (steps per millisecond=126 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 748 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), false]
Product exploration explored 100000 steps with 21736 reset in 342 ms.
Stack based approach found an accepted trace after 73765 steps with 16054 reset with depth 19 and stack size 19 in 277 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-02 finished in 6139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((p1 U p2)&&p3)))'
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 17 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:10:07] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:07] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:07] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-17 11:10:07] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:07] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:07] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2022-05-17 11:10:07] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 11:10:07] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:07] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:07] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p3:(LEQ (ADD s152 s153 s154 s155 s156 s157) (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 586 ms.
Product exploration explored 100000 steps with 50000 reset in 508 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))))]
Knowledge based reduction with 19 factoid took 789 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-05-17 11:10:10] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:10] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:10] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-17 11:10:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 11:10:10] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-17 11:10:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:10] [INFO ] After 145ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-05-17 11:10:11] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 3 ms to minimize.
[2022-05-17 11:10:11] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2022-05-17 11:10:11] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2022-05-17 11:10:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2022-05-17 11:10:11] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 11:10:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2022-05-17 11:10:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2022-05-17 11:10:11] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2022-05-17 11:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-17 11:10:11] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 127 ms.
[2022-05-17 11:10:11] [INFO ] After 1038ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 407399 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407399 steps, saw 161398 distinct states, run finished after 3002 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 4 properties.
[2022-05-17 11:10:14] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:14] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:14] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 11:10:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 17 ms returned sat
[2022-05-17 11:10:15] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 11:10:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:15] [INFO ] After 133ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-17 11:10:15] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2022-05-17 11:10:15] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-17 11:10:15] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2022-05-17 11:10:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 176 ms
[2022-05-17 11:10:15] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2022-05-17 11:10:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2022-05-17 11:10:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2022-05-17 11:10:15] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-05-17 11:10:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2022-05-17 11:10:15] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2022-05-17 11:10:16] [INFO ] After 1075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 17 ms.
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:10:16] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:16] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:16] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-17 11:10:16] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:16] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 11:10:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:16] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2022-05-17 11:10:16] [INFO ] Redundant transitions in 22 ms returned []
[2022-05-17 11:10:16] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:16] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:16] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 176 transition count 264
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 170 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 164 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 164 transition count 246
Applied a total of 114 rules in 16 ms. Remains 164 /176 variables (removed 12) and now considering 246/354 (removed 108) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 246 rows 164 cols
[2022-05-17 11:10:16] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 11:10:16] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 11:10:16] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 11:10:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-17 11:10:16] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 11:10:17] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 112 ms.
[2022-05-17 11:10:17] [INFO ] After 506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-05-17 11:10:17] [INFO ] Flatten gal took : 15 ms
[2022-05-17 11:10:17] [INFO ] Flatten gal took : 13 ms
[2022-05-17 11:10:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14054310866068502314.gal : 7 ms
[2022-05-17 11:10:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9162236397524305549.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15642966686818110759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14054310866068502314.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9162236397524305549.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality9162236397524305549.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :28 after 67
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :67 after 100
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :100 after 166
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :166 after 592
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :592 after 48888
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :48888 after 3.36749e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.36749e+06 after 2.62801e+07
Detected timeout of ITS tools.
[2022-05-17 11:10:32] [INFO ] Flatten gal took : 13 ms
[2022-05-17 11:10:32] [INFO ] Applying decomposition
[2022-05-17 11:10:32] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4425846421215187165.txt' '-o' '/tmp/graph4425846421215187165.bin' '-w' '/tmp/graph4425846421215187165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4425846421215187165.bin' '-l' '-1' '-v' '-w' '/tmp/graph4425846421215187165.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:10:32] [INFO ] Decomposing Gal with order
[2022-05-17 11:10:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:10:32] [INFO ] Removed a total of 168 redundant transitions.
[2022-05-17 11:10:32] [INFO ] Flatten gal took : 71 ms
[2022-05-17 11:10:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 7 ms.
[2022-05-17 11:10:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15782365164148794176.gal : 3 ms
[2022-05-17 11:10:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14323445729343372003.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15642966686818110759;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15782365164148794176.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14323445729343372003.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14323445729343372003.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 27
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :27 after 149
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :149 after 161
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :161 after 437
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :437 after 997
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :997 after 2745
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2745 after 5355
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :5355 after 11104
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :11104 after 294604
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :294604 after 975942
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :975942 after 4.71348e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,5.14952e+14,2.96354,68976,2,6814,17,339269,10,0,915,269593,0
Total reachable state count : 514951553191936

Verifying 4 reachability properties.
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,3.29672e+06,6.32409,68976,2,6880,17,339269,10,0,55141,269593,0
Reachability property apf5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf5,3.34376e+06,6.33361,68976,2,6880,17,339269,10,0,55142,269593,0
Reachability property apf8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf8,47040,9.9355,117024,2,1309,17,339269,10,0,109008,269593,0
Reachability property apf9 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf9,3.29672e+06,10.0269,119284,2,6880,17,339269,10,0,109198,269593,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))), (X (NOT (AND p3 (NOT p2) p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (NOT (AND p3 (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p2) p1 (NOT p0))))), (G (NOT (AND p1 (NOT p2) (NOT p0) p3)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1) p0))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p0 (NOT p3))))), (F (NOT (AND (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 20 factoid took 965 ms. Reduced automaton from 4 states, 11 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 126 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
[2022-05-17 11:10:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:44] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-17 11:10:44] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2022-05-17 11:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:10:44] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-05-17 11:10:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:10:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 18 ms returned sat
[2022-05-17 11:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:10:44] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-17 11:10:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:44] [INFO ] [Nat]Added 72 Read/Feed constraints in 10 ms returned sat
[2022-05-17 11:10:44] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 21 ms.
[2022-05-17 11:10:44] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:10:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:44] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:44] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-17 11:10:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:44] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 11:10:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:44] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2022-05-17 11:10:44] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 11:10:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:44] [INFO ] Computed 50 place invariants in 8 ms
[2022-05-17 11:10:45] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p3 (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 15 factoid took 616 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 123 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 11:10:45] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:45] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 11:10:46] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 11:10:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 11:10:46] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 11:10:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:46] [INFO ] After 52ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 11:10:46] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-17 11:10:46] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2022-05-17 11:10:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2022-05-17 11:10:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2022-05-17 11:10:46] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-17 11:10:46] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1318015 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :{}
Probabilistic random walk after 1318015 steps, saw 428965 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 11:10:49] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:49] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 11:10:49] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 11:10:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-17 11:10:49] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 11:10:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:49] [INFO ] After 46ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 11:10:49] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-17 11:10:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-05-17 11:10:49] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2022-05-17 11:10:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2022-05-17 11:10:49] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-17 11:10:50] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 66 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:10:50] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:50] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 11:10:50] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-17 11:10:50] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:50] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:10:50] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2022-05-17 11:10:50] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-17 11:10:50] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:10:50] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:50] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 176 transition count 264
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 102 place count 170 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 164 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 164 transition count 246
Applied a total of 114 rules in 11 ms. Remains 164 /176 variables (removed 12) and now considering 246/354 (removed 108) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 164 cols
[2022-05-17 11:10:50] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:10:50] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 11:10:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-17 11:10:50] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 11:10:50] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-17 11:10:50] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 11:10:50] [INFO ] Flatten gal took : 13 ms
[2022-05-17 11:10:50] [INFO ] Flatten gal took : 13 ms
[2022-05-17 11:10:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4504289411599486521.gal : 1 ms
[2022-05-17 11:10:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15351238887854934422.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5013162324107592482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4504289411599486521.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15351238887854934422.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality15351238887854934422.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 67
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :67 after 100
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :100 after 166
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :166 after 592
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :592 after 48888
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :48888 after 3.36749e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.36749e+06 after 2.62801e+07
Detected timeout of ITS tools.
[2022-05-17 11:11:05] [INFO ] Flatten gal took : 12 ms
[2022-05-17 11:11:05] [INFO ] Applying decomposition
[2022-05-17 11:11:05] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16995349305176010700.txt' '-o' '/tmp/graph16995349305176010700.bin' '-w' '/tmp/graph16995349305176010700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16995349305176010700.bin' '-l' '-1' '-v' '-w' '/tmp/graph16995349305176010700.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:11:05] [INFO ] Decomposing Gal with order
[2022-05-17 11:11:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:11:05] [INFO ] Removed a total of 168 redundant transitions.
[2022-05-17 11:11:05] [INFO ] Flatten gal took : 31 ms
[2022-05-17 11:11:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 7 ms.
[2022-05-17 11:11:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3669539963767696806.gal : 3 ms
[2022-05-17 11:11:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1878042348103711466.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms5013162324107592482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3669539963767696806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1878042348103711466.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1878042348103711466.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 139
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :139 after 147
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :147 after 159
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :159 after 425
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :425 after 1031
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1031 after 2783
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2783 after 3366
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3366 after 56464
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :56464 after 111020
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :111020 after 683925
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1361133421581327650
[2022-05-17 11:11:21] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1361133421581327650
Running compilation step : cd /tmp/ltsmin1361133421581327650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin1361133421581327650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1361133421581327650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf7==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p0 (NOT p2) p3 (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p3)))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (F (AND p0 (NOT p2) p3 p1)), (F (NOT (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3))))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 15 factoid took 798 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
[2022-05-17 11:11:37] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:11:37] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:11:37] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2022-05-17 11:11:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:11:37] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2022-05-17 11:11:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:11:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 17 ms returned sat
[2022-05-17 11:11:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:11:37] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-17 11:11:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-17 11:11:37] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2022-05-17 11:11:37] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 18 ms.
[2022-05-17 11:11:37] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 366 ms.
Product exploration explored 100000 steps with 50000 reset in 374 ms.
Built C files in :
/tmp/ltsmin10460495707062577442
[2022-05-17 11:11:38] [INFO ] Computing symmetric may disable matrix : 354 transitions.
[2022-05-17 11:11:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 11:11:38] [INFO ] Computing symmetric may enable matrix : 354 transitions.
[2022-05-17 11:11:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 11:11:38] [INFO ] Computing Do-Not-Accords matrix : 354 transitions.
[2022-05-17 11:11:38] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 11:11:38] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10460495707062577442
Running compilation step : cd /tmp/ltsmin10460495707062577442;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 663 ms.
Running link step : cd /tmp/ltsmin10460495707062577442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10460495707062577442;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13416766480511212428.hoa' '--buchi-type=spotba'
LTSmin run took 376 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-03 finished in 92465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:11:39] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:11:39] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-17 11:11:39] [INFO ] Implicit Places using invariants in 124 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 125 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-05 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:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-05 finished in 313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((p0 U p1)))))'
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:11:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:11:40] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 11:11:40] [INFO ] Implicit Places using invariants in 134 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 144 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 15 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2022-05-17 11:11:40] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 11:11:40] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 11:11:40] [INFO ] Implicit Places using invariants in 143 ms returned []
[2022-05-17 11:11:40] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2022-05-17 11:11:40] [INFO ] Computed 44 place invariants in 0 ms
[2022-05-17 11:11:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 11:11:40] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 164/176 places, 348/354 transitions.
Finished structural reductions, in 2 iterations. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s146 s147 s148 s149 s150 s151) (ADD s68 s69 s70 s71 s72 s73))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1955 reset in 215 ms.
Stack based approach found an accepted trace after 4998 steps with 91 reset with depth 74 and stack size 74 in 13 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-07 finished in 867 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(X(F((G(p0)&&p1))))))||(p0 U p1)))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:11:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:11:40] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-17 11:11:41] [INFO ] Implicit Places using invariants in 123 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 125 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s164 1)), p0:(OR (EQ s156 0) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14182 reset in 228 ms.
Product exploration explored 100000 steps with 13998 reset in 228 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 7 states, 14 edges and 2 AP to 7 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 11:11:42] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 11:11:42] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-17 11:11:42] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2022-05-17 11:11:42] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT p0)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 7 states, 14 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2022-05-17 11:11:42] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 11:11:42] [INFO ] Computed 44 place invariants in 2 ms
[2022-05-17 11:11:42] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2022-05-17 11:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:11:42] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-17 11:11:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:11:43] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2022-05-17 11:11:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:11:43] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-17 11:11:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 11:11:43] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2022-05-17 11:11:43] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2022-05-17 11:11:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2022-05-17 11:11:43] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-05-17 11:11:43] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2022-05-17 11:11:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 196 ms
[2022-05-17 11:11:43] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 16 ms.
[2022-05-17 11:11:43] [INFO ] Added : 123 causal constraints over 25 iterations in 539 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 170 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:11:43] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 11:11:43] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 11:11:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-17 11:11:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 11:11:44] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 11:11:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 11:11:44] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2022-05-17 11:11:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 11:11:44] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 11:11:44] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2022-05-17 11:11:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 11:11:44] [INFO ] Computed 44 place invariants in 4 ms
[2022-05-17 11:11:45] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2022-05-17 11:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:11:45] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2022-05-17 11:11:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:11:45] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2022-05-17 11:11:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:11:45] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-17 11:11:45] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-05-17 11:11:45] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2022-05-17 11:11:45] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-05-17 11:11:45] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2022-05-17 11:11:45] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-17 11:11:45] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-05-17 11:11:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 206 ms
[2022-05-17 11:11:45] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 16 ms.
[2022-05-17 11:11:46] [INFO ] Added : 123 causal constraints over 25 iterations in 517 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 14061 reset in 184 ms.
Product exploration explored 100000 steps with 14111 reset in 192 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 170 transition count 354
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 6 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:11:46] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-17 11:11:46] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2022-05-17 11:11:46] [INFO ] Computed 44 place invariants in 1 ms
[2022-05-17 11:11:46] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/170 places, 354/354 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 354/354 transitions.
Product exploration explored 100000 steps with 14063 reset in 440 ms.
Stack based approach found an accepted trace after 93465 steps with 13168 reset with depth 12 and stack size 10 in 409 ms.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-08 finished in 6804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((G(p0)||p1)))||X(p2)))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2022-05-17 11:11:47] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2022-05-17 11:11:47] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-17 11:11:47] [INFO ] Implicit Places using invariants in 122 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 123 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-6-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s143 1), p1:(EQ s44 0), p0:(AND (EQ s63 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1))))
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA LamportFastMutEx-PT-6-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-6-LTLCardinality-10 finished in 731 ms.
All properties solved by simple procedures.
Total runtime 110490 ms.

BK_STOP 1652785908615

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-6"
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-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-6, 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 r132-tall-165271820900427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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