Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 7 12:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 7 12:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 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 Murphy-COL-D4N025-LTLCardinality-00
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-01
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-02
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-03
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-04
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-05
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-06
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-07
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-08
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-09
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-10
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-11
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-12
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-13
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-14
FORMULA_NAME Murphy-COL-D4N025-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680937663205

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D4N025
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2023-04-08 07:07:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-08 07:07:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:07:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-08 07:07:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:07:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 494 ms
[2023-04-08 07:07:45] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 07:07:45] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 5 ms.
[2023-04-08 07:07:45] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Murphy-COL-D4N025-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10102 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=315 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-08 07:07:46] [INFO ] Computed 2 invariants in 5 ms
[2023-04-08 07:07:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-04-08 07:07:46] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:07:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:07:46] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-04-08 07:07:46] [INFO ] Flatten gal took : 13 ms
[2023-04-08 07:07:46] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:07:46] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 6 ms.
[2023-04-08 07:07:46] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:07:46] [INFO ] Computed 6 invariants in 1 ms
[2023-04-08 07:07:46] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
[2023-04-08 07:07:46] [INFO ] Invariant cache hit.
[2023-04-08 07:07:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-08 07:07:46] [INFO ] Invariant cache hit.
[2023-04-08 07:07:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:07:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-08 07:07:46] [INFO ] Invariant cache hit.
[2023-04-08 07:07:46] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-08 07:07:46] [INFO ] Flatten gal took : 5 ms
[2023-04-08 07:07:46] [INFO ] Flatten gal took : 10 ms
[2023-04-08 07:07:46] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-08 07:07:46] [INFO ] Invariant cache hit.
[2023-04-08 07:07:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:07:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:07:46] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:07:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:07:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:07:46] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:07:47] [INFO ] Invariant cache hit.
[2023-04-08 07:07:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-04-08 07:07:47] [INFO ] Invariant cache hit.
[2023-04-08 07:07:47] [INFO ] Implicit Places using invariants in 30 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 34 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 25/30 places, 35/35 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 2 (ADD s20 s21 s22 s23 s24)), p1:(GT (ADD s5 s6 s7 s8 s9) (ADD s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 327 ms.
Stack based approach found an accepted trace after 22260 steps with 0 reset with depth 22261 and stack size 21760 in 66 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N025-LTLCardinality-01 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:07:47] [INFO ] Invariant cache hit.
[2023-04-08 07:07:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:07:47] [INFO ] Invariant cache hit.
[2023-04-08 07:07:47] [INFO ] Implicit Places using invariants in 35 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s15 s16 s17 s18 s19) (ADD s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 239 ms.
Stack based approach found an accepted trace after 1526 steps with 0 reset with depth 1527 and stack size 1497 in 5 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N025-LTLCardinality-02 finished in 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:07:48] [INFO ] Invariant cache hit.
[2023-04-08 07:07:48] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
[2023-04-08 07:07:48] [INFO ] Invariant cache hit.
[2023-04-08 07:07:48] [INFO ] Implicit Places using invariants in 31 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 32 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s15 s16 s17 s18 s19)), p1:(GT (ADD s20 s21 s22 s23 s24) (ADD s10 s11 s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2054 reset in 271 ms.
Stack based approach found an accepted trace after 6889 steps with 160 reset with depth 60 and stack size 60 in 22 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N025-LTLCardinality-04 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(X(p1) U (X(G(p1))||(p2&&X(p1))))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:07:48] [INFO ] Invariant cache hit.
[2023-04-08 07:07:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:07:48] [INFO ] Invariant cache hit.
[2023-04-08 07:07:48] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:07:48] [INFO ] Invariant cache hit.
[2023-04-08 07:07:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:07:48] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-08 07:07:48] [INFO ] Invariant cache hit.
[2023-04-08 07:07:48] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GT (ADD s0 s1 s2 s3 s4) (ADD s25 s26 s27 s28 s29)), p0:(OR (GT 2 (ADD s10 s11 s12 s13 s14)) (GT (ADD s0 s1 s2 s3 s4) (ADD s25 s26 s27 s28 s29))), p1:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 231 steps with 37 reset in 2 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N025-LTLCardinality-05 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:07:49] [INFO ] Invariant cache hit.
[2023-04-08 07:07:49] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-04-08 07:07:49] [INFO ] Invariant cache hit.
[2023-04-08 07:07:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-08 07:07:49] [INFO ] Invariant cache hit.
[2023-04-08 07:07:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:07:49] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-04-08 07:07:49] [INFO ] Invariant cache hit.
[2023-04-08 07:07:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ (ADD s10 s11 s12 s13 s14) (ADD s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 159 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D4N025-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D4N025-LTLCardinality-06 finished in 658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:07:49] [INFO ] Invariant cache hit.
[2023-04-08 07:07:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-04-08 07:07:49] [INFO ] Invariant cache hit.
[2023-04-08 07:07:49] [INFO ] Implicit Places using invariants in 33 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 34 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s20 s21 s22 s23 s24))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4396 steps with 0 reset in 16 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N025-LTLCardinality-08 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:07:50] [INFO ] Invariant cache hit.
[2023-04-08 07:07:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:07:50] [INFO ] Invariant cache hit.
[2023-04-08 07:07:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-04-08 07:07:50] [INFO ] Invariant cache hit.
[2023-04-08 07:07:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:07:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-04-08 07:07:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:07:50] [INFO ] Invariant cache hit.
[2023-04-08 07:07:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s10 s11 s12 s13 s14) (ADD s5 s6 s7 s8 s9)), p1:(GT 3 (ADD s25 s26 s27 s28 s29))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 355 ms.
Stack based approach found an accepted trace after 493 steps with 0 reset with depth 494 and stack size 484 in 2 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N025-LTLCardinality-09 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:07:50] [INFO ] Invariant cache hit.
[2023-04-08 07:07:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:07:50] [INFO ] Invariant cache hit.
[2023-04-08 07:07:50] [INFO ] Implicit Places using invariants in 33 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 34 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4))], 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 0 reset in 199 ms.
Product exploration explored 100000 steps with 0 reset in 355 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 935 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=155 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 25 cols
[2023-04-08 07:07:51] [INFO ] Computed 1 invariants in 7 ms
[2023-04-08 07:07:51] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-04-08 07:07:51] [INFO ] Invariant cache hit.
[2023-04-08 07:07:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:07:51] [INFO ] Invariant cache hit.
[2023-04-08 07:07:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:07:51] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:07:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:07:51] [INFO ] Invariant cache hit.
[2023-04-08 07:07:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 25/25 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 946 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=157 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 205 ms.
Product exploration explored 100000 steps with 0 reset in 367 ms.
Built C files in :
/tmp/ltsmin6215706768717877460
[2023-04-08 07:07:53] [INFO ] Computing symmetric may disable matrix : 35 transitions.
[2023-04-08 07:07:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:07:53] [INFO ] Computing symmetric may enable matrix : 35 transitions.
[2023-04-08 07:07:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:07:53] [INFO ] Computing Do-Not-Accords matrix : 35 transitions.
[2023-04-08 07:07:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:07:53] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6215706768717877460
Running compilation step : cd /tmp/ltsmin6215706768717877460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin6215706768717877460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6215706768717877460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2999129636441527267.hoa' '--buchi-type=spotba'
LTSmin run took 8700 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Murphy-COL-D4N025-LTLCardinality-10 finished in 11680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))||F((G(F(p2))||(F(p2)&&X(p1))))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:08:02] [INFO ] Computed 6 invariants in 1 ms
[2023-04-08 07:08:02] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-04-08 07:08:02] [INFO ] Invariant cache hit.
[2023-04-08 07:08:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:08:02] [INFO ] Invariant cache hit.
[2023-04-08 07:08:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:02] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-08 07:08:02] [INFO ] Invariant cache hit.
[2023-04-08 07:08:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GT (ADD s0 s1 s2 s3 s4) (ADD s20 s21 s22 s23 s24)), p1:(LEQ 2 (ADD s20 s21 s22 s23 s24)), p0:(LEQ 3 (ADD s10 s11 s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26377 reset in 217 ms.
Product exploration explored 100000 steps with 26478 reset in 225 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 429 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), false, false, false, false]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-04-08 07:08:04] [INFO ] Invariant cache hit.
[2023-04-08 07:08:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-08 07:08:04] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-04-08 07:08:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-04-08 07:08:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:04] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-04-08 07:08:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:04] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-04-08 07:08:04] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 8 ms to minimize.
[2023-04-08 07:08:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-04-08 07:08:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2023-04-08 07:08:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-08 07:08:04] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-08 07:08:04] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:08:04] [INFO ] Invariant cache hit.
[2023-04-08 07:08:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 505683 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 505683 steps, saw 350992 distinct states, run finished after 3002 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:08:07] [INFO ] Invariant cache hit.
[2023-04-08 07:08:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-08 07:08:07] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-08 07:08:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:07] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-08 07:08:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:07] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-08 07:08:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-04-08 07:08:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-04-08 07:08:07] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-08 07:08:07] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:08:07] [INFO ] Invariant cache hit.
[2023-04-08 07:08:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:08:07] [INFO ] Invariant cache hit.
[2023-04-08 07:08:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-04-08 07:08:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:08:08] [INFO ] Invariant cache hit.
[2023-04-08 07:08:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-04-08 07:08:08] [INFO ] Invariant cache hit.
[2023-04-08 07:08:08] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:08] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-08 07:08:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:08] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-08 07:08:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:08] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-08 07:08:08] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2023-04-08 07:08:08] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2023-04-08 07:08:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2023-04-08 07:08:08] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-08 07:08:08] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) p1)), (F p1), (F (NOT (OR p0 p1))), (F (AND (NOT p2) p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p2 p1)), (F (NOT p2))]
Knowledge based reduction with 16 factoid took 915 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), false, false]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), false, false]
Support contains 10 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:08:09] [INFO ] Invariant cache hit.
[2023-04-08 07:08:09] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
[2023-04-08 07:08:09] [INFO ] Invariant cache hit.
[2023-04-08 07:08:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-04-08 07:08:09] [INFO ] Invariant cache hit.
[2023-04-08 07:08:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-04-08 07:08:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:08:09] [INFO ] Invariant cache hit.
[2023-04-08 07:08:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 30/30 places, 35/35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1))))]
Knowledge based reduction with 7 factoid took 372 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:08:10] [INFO ] Invariant cache hit.
[2023-04-08 07:08:10] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2023-04-08 07:08:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 33 ms returned sat
[2023-04-08 07:08:10] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:10] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:10] [INFO ] After 7ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:10] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2023-04-08 07:08:10] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-04-08 07:08:11] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2023-04-08 07:08:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2023-04-08 07:08:11] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-08 07:08:11] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:08:11] [INFO ] Invariant cache hit.
[2023-04-08 07:08:11] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 1649208 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :{}
Probabilistic random walk after 1649208 steps, saw 1147581 distinct states, run finished after 3001 ms. (steps per millisecond=549 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:08:14] [INFO ] Invariant cache hit.
[2023-04-08 07:08:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-08 07:08:14] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:14] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:14] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:14] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2023-04-08 07:08:14] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2023-04-08 07:08:14] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2023-04-08 07:08:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 96 ms
[2023-04-08 07:08:14] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-08 07:08:14] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:08:14] [INFO ] Invariant cache hit.
[2023-04-08 07:08:14] [INFO ] Implicit Places using invariants in 30 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 31 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34 ms. Remains : 25/30 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1902942 steps, run timeout after 3001 ms. (steps per millisecond=634 ) properties seen :{}
Probabilistic random walk after 1902942 steps, saw 1330283 distinct states, run finished after 3001 ms. (steps per millisecond=634 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 25 cols
[2023-04-08 07:08:17] [INFO ] Computed 1 invariants in 4 ms
[2023-04-08 07:08:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:17] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:17] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:17] [INFO ] After 11ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:17] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-08 07:08:17] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:08:17] [INFO ] Invariant cache hit.
[2023-04-08 07:08:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:08:17] [INFO ] Invariant cache hit.
[2023-04-08 07:08:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:08:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:08:17] [INFO ] Invariant cache hit.
[2023-04-08 07:08:17] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-04-08 07:08:17] [INFO ] Invariant cache hit.
[2023-04-08 07:08:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:17] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:17] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:08:17] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:17] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2023-04-08 07:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-08 07:08:17] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-08 07:08:17] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (F (NOT p2)), (F p1), (F (AND p1 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 501 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), false, false]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), false, false]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), false, false]
Product exploration explored 100000 steps with 26568 reset in 195 ms.
Product exploration explored 100000 steps with 26536 reset in 243 ms.
Built C files in :
/tmp/ltsmin2206354441104905915
[2023-04-08 07:08:19] [INFO ] Computing symmetric may disable matrix : 35 transitions.
[2023-04-08 07:08:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:19] [INFO ] Computing symmetric may enable matrix : 35 transitions.
[2023-04-08 07:08:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:19] [INFO ] Computing Do-Not-Accords matrix : 35 transitions.
[2023-04-08 07:08:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:19] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2206354441104905915
Running compilation step : cd /tmp/ltsmin2206354441104905915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin2206354441104905915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2206354441104905915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6154691507034755099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-08 07:08:34] [INFO ] Computed 6 invariants in 1 ms
[2023-04-08 07:08:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-04-08 07:08:34] [INFO ] Invariant cache hit.
[2023-04-08 07:08:34] [INFO ] Implicit Places using invariants in 29 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 30 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 25/30 places, 35/35 transitions.
Built C files in :
/tmp/ltsmin8183621828756074791
[2023-04-08 07:08:34] [INFO ] Computing symmetric may disable matrix : 35 transitions.
[2023-04-08 07:08:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:34] [INFO ] Computing symmetric may enable matrix : 35 transitions.
[2023-04-08 07:08:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:34] [INFO ] Computing Do-Not-Accords matrix : 35 transitions.
[2023-04-08 07:08:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8183621828756074791
Running compilation step : cd /tmp/ltsmin8183621828756074791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin8183621828756074791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8183621828756074791;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3879881964374898739.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-08 07:08:50] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:08:50] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:08:50] [INFO ] Time to serialize gal into /tmp/LTL10713991059691946083.gal : 2 ms
[2023-04-08 07:08:50] [INFO ] Time to serialize properties into /tmp/LTL12064796250041034349.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10713991059691946083.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16270506845805663948.hoa' '-atoms' '/tmp/LTL12064796250041034349.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12064796250041034349.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16270506845805663948.hoa
Detected timeout of ITS tools.
[2023-04-08 07:09:05] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:09:05] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:09:05] [INFO ] Time to serialize gal into /tmp/LTL2104538485332911147.gal : 1 ms
[2023-04-08 07:09:05] [INFO ] Time to serialize properties into /tmp/LTL330972863286562464.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2104538485332911147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL330972863286562464.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((X(("((((p2_0+p2_1)+(p2_2+p2_3))+p2_4)>=3)")U(G("((((p4_0+p4_1)+(p4_2+p4_3))+p4_4)>=2)"))))||(F((G(F("((((p0_0+p0_1)+(p0_2+p0_3))+p...325
Formula 0 simplified : X(!"((((p2_0+p2_1)+(p2_2+p2_3))+p2_4)>=3)" R F!"((((p4_0+p4_1)+(p4_2+p4_3))+p4_4)>=2)") & G(FG!"((((p0_0+p0_1)+(p0_2+p0_3))+p0_4)>((...308
Detected timeout of ITS tools.
[2023-04-08 07:09:20] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:09:20] [INFO ] Applying decomposition
[2023-04-08 07:09:20] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2670035187949013487.txt' '-o' '/tmp/graph2670035187949013487.bin' '-w' '/tmp/graph2670035187949013487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2670035187949013487.bin' '-l' '-1' '-v' '-w' '/tmp/graph2670035187949013487.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:09:20] [INFO ] Decomposing Gal with order
[2023-04-08 07:09:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:09:20] [INFO ] Flatten gal took : 14 ms
[2023-04-08 07:09:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-08 07:09:20] [INFO ] Time to serialize gal into /tmp/LTL16377472617882773670.gal : 1 ms
[2023-04-08 07:09:20] [INFO ] Time to serialize properties into /tmp/LTL8811749371824455871.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16377472617882773670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8811749371824455871.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(("((((gu1.p2_0+gu1.p2_1)+(gu1.p2_2+gu1.p2_3))+gu1.p2_4)>=3)")U(G("((((gi3.gu4.p4_0+gi3.gu4.p4_1)+(gi3.gu4.p4_2+gi3.gu4.p4_3))+gi...585
Formula 0 simplified : X(!"((((gu1.p2_0+gu1.p2_1)+(gu1.p2_2+gu1.p2_3))+gu1.p2_4)>=3)" R F!"((((gi3.gu4.p4_0+gi3.gu4.p4_1)+(gi3.gu4.p4_2+gi3.gu4.p4_3))+gi3....568
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15176040027850377908
[2023-04-08 07:09:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15176040027850377908
Running compilation step : cd /tmp/ltsmin15176040027850377908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin15176040027850377908;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15176040027850377908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U []((LTLAPp1==true))))||<>(([](<>((LTLAPp2==true)))||(<>((LTLAPp2==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Murphy-COL-D4N025-LTLCardinality-11 finished in 108174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p1||X(!p1))))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:09:50] [INFO ] Invariant cache hit.
[2023-04-08 07:09:50] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-04-08 07:09:50] [INFO ] Invariant cache hit.
[2023-04-08 07:09:50] [INFO ] Implicit Places using invariants in 32 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 33 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), false, p1, true]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 (ADD s5 s6 s7 s8 s9)), p1:(GT (ADD s0 s1 s2 s3 s4) (ADD s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2064 steps with 1 reset in 7 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N025-LTLCardinality-12 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-08 07:09:50] [INFO ] Invariant cache hit.
[2023-04-08 07:09:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:09:50] [INFO ] Invariant cache hit.
[2023-04-08 07:09:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:09:50] [INFO ] Invariant cache hit.
[2023-04-08 07:09:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-08 07:09:50] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-04-08 07:09:50] [INFO ] Invariant cache hit.
[2023-04-08 07:09:50] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D4N025-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ (ADD s15 s16 s17 s18 s19) (ADD s25 s26 s27 s28 s29)), p0:(LEQ (ADD s20 s21 s22 s23 s24) (ADD s10 s11 s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 329 steps with 0 reset in 2 ms.
FORMULA Murphy-COL-D4N025-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N025-LTLCardinality-14 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))||F((G(F(p2))||(F(p2)&&X(p1))))))'
[2023-04-08 07:09:51] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1882060971444542149
[2023-04-08 07:09:51] [INFO ] Computing symmetric may disable matrix : 35 transitions.
[2023-04-08 07:09:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:09:51] [INFO ] Computing symmetric may enable matrix : 35 transitions.
[2023-04-08 07:09:51] [INFO ] Applying decomposition
[2023-04-08 07:09:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:09:51] [INFO ] Computing Do-Not-Accords matrix : 35 transitions.
[2023-04-08 07:09:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:09:51] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:09:51] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1882060971444542149
Running compilation step : cd /tmp/ltsmin1882060971444542149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6672059537817873122.txt' '-o' '/tmp/graph6672059537817873122.bin' '-w' '/tmp/graph6672059537817873122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6672059537817873122.bin' '-l' '-1' '-v' '-w' '/tmp/graph6672059537817873122.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:09:51] [INFO ] Decomposing Gal with order
[2023-04-08 07:09:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:09:51] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:09:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-04-08 07:09:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality17201679500564091483.gal : 2 ms
[2023-04-08 07:09:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality10250125846709049950.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17201679500564091483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10250125846709049950.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !(((X(("((((gu1.p2_0+gu1.p2_1)+(gu1.p2_2+gu1.p2_3))+gu1.p2_4)>=3)")U(G("((((gi0.gu4.p4_0+gi0.gu4.p4_1)+(gi0.gu4.p4_2+gi0.gu4.p4_3))+gi...585
Formula 0 simplified : X(!"((((gu1.p2_0+gu1.p2_1)+(gu1.p2_2+gu1.p2_3))+gu1.p2_4)>=3)" R F!"((((gi0.gu4.p4_0+gi0.gu4.p4_1)+(gi0.gu4.p4_2+gi0.gu4.p4_3))+gi0....568
Compilation finished in 136 ms.
Running link step : cd /tmp/ltsmin1882060971444542149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1882060971444542149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U []((LTLAPp1==true))))||<>(([](<>((LTLAPp2==true)))||(<>((LTLAPp2==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: (X(((LTLAPp0==true) U []((LTLAPp1==true))))||<>(([](<>((LTLAPp2==true)))||(<>((LTLAPp2==true))&&X((LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.002: "(X(((LTLAPp0==true) U []((LTLAPp1==true))))||<>(([](<>((LTLAPp2==true)))||(<>((LTLAPp2==true))&&X((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: There are 39 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.019: State length is 31, there are 54 groups
pins2lts-mc-linux64( 0/ 8), 0.019: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.019: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.019: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.019: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.044: [Blue] ~47 levels ~960 states ~3352 transitions
pins2lts-mc-linux64( 0/ 8), 0.104: [Blue] ~95 levels ~1920 states ~6448 transitions
pins2lts-mc-linux64( 5/ 8), 0.152: [Blue] ~200 levels ~3840 states ~17488 transitions
pins2lts-mc-linux64( 5/ 8), 0.174: [Blue] ~294 levels ~7680 states ~24360 transitions
pins2lts-mc-linux64( 5/ 8), 0.210: [Blue] ~324 levels ~15360 states ~34072 transitions
pins2lts-mc-linux64( 5/ 8), 0.289: [Blue] ~341 levels ~30720 states ~53560 transitions
pins2lts-mc-linux64( 5/ 8), 0.489: [Blue] ~372 levels ~61440 states ~95952 transitions
pins2lts-mc-linux64( 2/ 8), 0.806: [Blue] ~361 levels ~122880 states ~172704 transitions
pins2lts-mc-linux64( 2/ 8), 1.209: [Blue] ~405 levels ~245760 states ~353480 transitions
pins2lts-mc-linux64( 2/ 8), 1.763: [Blue] ~500 levels ~491520 states ~727568 transitions
pins2lts-mc-linux64( 2/ 8), 2.450: [Blue] ~621 levels ~983040 states ~1516928 transitions
pins2lts-mc-linux64( 5/ 8), 3.361: [Blue] ~636 levels ~1966080 states ~3128632 transitions
pins2lts-mc-linux64( 5/ 8), 5.122: [Blue] ~793 levels ~3932160 states ~6362176 transitions
pins2lts-mc-linux64( 5/ 8), 8.818: [Blue] ~1006 levels ~7864320 states ~13070472 transitions
pins2lts-mc-linux64( 5/ 8), 16.266: [Blue] ~1350 levels ~15728640 states ~26874616 transitions
pins2lts-mc-linux64( 7/ 8), 33.887: [Blue] ~1860 levels ~31457280 states ~56195584 transitions
pins2lts-mc-linux64( 5/ 8), 64.097: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 64.134:
pins2lts-mc-linux64( 0/ 8), 64.134: Explored 53908795 states 97712749 transitions, fanout: 1.813
pins2lts-mc-linux64( 0/ 8), 64.134: Total exploration time 64.090 sec (64.030 sec minimum, 64.061 sec on average)
pins2lts-mc-linux64( 0/ 8), 64.134: States per second: 841142, Transitions per second: 1524618
pins2lts-mc-linux64( 0/ 8), 64.134:
pins2lts-mc-linux64( 0/ 8), 64.134: State space has 53942540 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 64.134: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 64.134: blue states: 53908795 (99.94%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 64.134: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 64.134: all-red states: 44963126 (83.35%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 64.134:
pins2lts-mc-linux64( 0/ 8), 64.134: Total memory used for local state coloring: 0.3MB
pins2lts-mc-linux64( 0/ 8), 64.134:
pins2lts-mc-linux64( 0/ 8), 64.134: Queue width: 8B, total height: 21752, memory: 0.17MB
pins2lts-mc-linux64( 0/ 8), 64.134: Tree memory: 667.5MB, 13.0 B/state, compr.: 10.3%
pins2lts-mc-linux64( 0/ 8), 64.134: Tree fill ratio (roots/leafs): 40.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 64.134: Stored 35 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 64.134: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 64.134: Est. total memory use: 667.7MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1882060971444542149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U []((LTLAPp1==true))))||<>(([](<>((LTLAPp2==true)))||(<>((LTLAPp2==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1882060971444542149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U []((LTLAPp1==true))))||<>(([](<>((LTLAPp2==true)))||(<>((LTLAPp2==true))&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
Detected timeout of ITS tools.
[2023-04-08 07:30:32] [INFO ] Applying decomposition
[2023-04-08 07:30:32] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:30:32] [INFO ] Decomposing Gal with order
[2023-04-08 07:30:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:30:32] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:30:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-04-08 07:30:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality17794136796468154248.gal : 1 ms
[2023-04-08 07:30:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality3526946689599468061.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17794136796468154248.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3526946689599468061.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !(((X(("((((gCD0.p2_0+gCD1.p2_1)+(gCD2.p2_2+gCD3.p2_3))+gCD4.p2_4)>=3)")U(G("((((gCD0.p4_0+gCD1.p4_1)+(gCD2.p4_2+gCD3.p4_3))+gCD4.p4_4...500
Formula 0 simplified : X(!"((((gCD0.p2_0+gCD1.p2_1)+(gCD2.p2_2+gCD3.p2_3))+gCD4.p2_4)>=3)" R F!"((((gCD0.p4_0+gCD1.p4_1)+(gCD2.p4_2+gCD3.p4_3))+gCD4.p4_4)>...483
Reverse transition relation is NOT exact ! Due to transitions gCD0.t0, gCD1.t1, gCD2.t2, gCD3.t3, gCD4.t4, Intersection with reachable at each step enable...204
Detected timeout of ITS tools.
[2023-04-08 07:51:13] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:51:13] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-08 07:51:13] [INFO ] Transformed 30 places.
[2023-04-08 07:51:13] [INFO ] Transformed 35 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-04-08 07:51:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality15619123420097251594.gal : 1 ms
[2023-04-08 07:51:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality11352815327715838327.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15619123420097251594.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11352815327715838327.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(("((((p2_0+p2_1)+(p2_2+p2_3))+p2_4)>=3)")U(G("((((p4_0+p4_1)+(p4_2+p4_3))+p4_4)>=2)"))))||(F((G(F("((((p0_0+p0_1)+(p0_2+p0_3))+p...325
Formula 0 simplified : X(!"((((p2_0+p2_1)+(p2_2+p2_3))+p2_4)>=3)" R F!"((((p4_0+p4_1)+(p4_2+p4_3))+p4_4)>=2)") & G(FG!"((((p0_0+p0_1)+(p0_2+p0_3))+p0_4)>((...308
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10425844 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16041036 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Murphy-COL-D4N025, 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 r517-tall-167987243700315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D4N025.tgz
mv Murphy-COL-D4N025 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 ;