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.r389-oct2-167903713100107.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713100107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 332K Mar 5 18:23 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 ShieldIIPs-PT-020B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679171876458

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=ShieldIIPs-PT-020B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 20:37:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:37:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:37:59] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-18 20:37:59] [INFO ] Transformed 1203 places.
[2023-03-18 20:37:59] [INFO ] Transformed 1183 transitions.
[2023-03-18 20:37:59] [INFO ] Found NUPN structural information;
[2023-03-18 20:37:59] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 1069 transition count 1049
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 1069 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 1068 transition count 1048
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 1068 transition count 1048
Applied a total of 270 rules in 271 ms. Remains 1068 /1203 variables (removed 135) and now considering 1048/1183 (removed 135) transitions.
// Phase 1: matrix 1048 rows 1068 cols
[2023-03-18 20:38:00] [INFO ] Computed 181 place invariants in 36 ms
[2023-03-18 20:38:00] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-18 20:38:00] [INFO ] Invariant cache hit.
[2023-03-18 20:38:02] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 2239 ms to find 0 implicit places.
[2023-03-18 20:38:02] [INFO ] Invariant cache hit.
[2023-03-18 20:38:02] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1068/1203 places, 1048/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3113 ms. Remains : 1068/1203 places, 1048/1183 transitions.
Support contains 30 out of 1068 places after structural reductions.
[2023-03-18 20:38:03] [INFO ] Flatten gal took : 136 ms
[2023-03-18 20:38:03] [INFO ] Flatten gal took : 54 ms
[2023-03-18 20:38:03] [INFO ] Input system was already deterministic with 1048 transitions.
Finished random walk after 1837 steps, including 0 resets, run visited all 18 properties in 133 ms. (steps per millisecond=13 )
FORMULA ShieldIIPs-PT-020B-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 242 stabilizing places and 242 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1067 transition count 946
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 859 transition count 839
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 416 place count 859 transition count 838
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 858 transition count 838
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 2 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1128 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 500 transition count 481
Applied a total of 1131 rules in 206 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-18 20:38:03] [INFO ] Computed 180 place invariants in 5 ms
[2023-03-18 20:38:04] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-18 20:38:04] [INFO ] Invariant cache hit.
[2023-03-18 20:38:04] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2023-03-18 20:38:05] [INFO ] Redundant transitions in 128 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2023-03-18 20:38:05] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:38:05] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1068 places, 480/1048 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1592 ms. Remains : 500/1068 places, 480/1048 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-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:(NEQ s303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 96 reset in 661 ms.
Product exploration explored 100000 steps with 95 reset in 633 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 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 230 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=115 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 34 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-18 20:38:07] [INFO ] Invariant cache hit.
[2023-03-18 20:38:07] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-18 20:38:07] [INFO ] Invariant cache hit.
[2023-03-18 20:38:08] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2023-03-18 20:38:08] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-18 20:38:08] [INFO ] Invariant cache hit.
[2023-03-18 20:38:08] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1273 ms. Remains : 500/500 places, 480/480 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 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 217 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=72 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Product exploration explored 100000 steps with 96 reset in 574 ms.
Product exploration explored 100000 steps with 96 reset in 590 ms.
Built C files in :
/tmp/ltsmin12994441573541800830
[2023-03-18 20:38:10] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2023-03-18 20:38:10] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:38:10] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2023-03-18 20:38:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:38:10] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2023-03-18 20:38:10] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:38:10] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12994441573541800830
Running compilation step : cd /tmp/ltsmin12994441573541800830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1236 ms.
Running link step : cd /tmp/ltsmin12994441573541800830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin12994441573541800830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2332598634332953897.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-18 20:38:25] [INFO ] Invariant cache hit.
[2023-03-18 20:38:25] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-18 20:38:25] [INFO ] Invariant cache hit.
[2023-03-18 20:38:26] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2023-03-18 20:38:26] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-18 20:38:26] [INFO ] Invariant cache hit.
[2023-03-18 20:38:26] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1421 ms. Remains : 500/500 places, 480/480 transitions.
Built C files in :
/tmp/ltsmin13399095014164664786
[2023-03-18 20:38:26] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2023-03-18 20:38:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:38:26] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2023-03-18 20:38:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:38:26] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2023-03-18 20:38:26] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:38:26] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13399095014164664786
Running compilation step : cd /tmp/ltsmin13399095014164664786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1034 ms.
Running link step : cd /tmp/ltsmin13399095014164664786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin13399095014164664786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3695579580168330575.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:38:42] [INFO ] Flatten gal took : 29 ms
[2023-03-18 20:38:42] [INFO ] Flatten gal took : 25 ms
[2023-03-18 20:38:42] [INFO ] Time to serialize gal into /tmp/LTL7788490099294633356.gal : 6 ms
[2023-03-18 20:38:42] [INFO ] Time to serialize properties into /tmp/LTL10736944145651607552.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7788490099294633356.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5369283479876707679.hoa' '-atoms' '/tmp/LTL10736944145651607552.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10736944145651607552.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5369283479876707679.hoa
Detected timeout of ITS tools.
[2023-03-18 20:38:57] [INFO ] Flatten gal took : 37 ms
[2023-03-18 20:38:57] [INFO ] Flatten gal took : 31 ms
[2023-03-18 20:38:57] [INFO ] Time to serialize gal into /tmp/LTL510465335318106994.gal : 5 ms
[2023-03-18 20:38:57] [INFO ] Time to serialize properties into /tmp/LTL3103200246627932229.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL510465335318106994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3103200246627932229.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G("(p740!=1)"))))
Formula 0 simplified : GF!"(p740!=1)"
Detected timeout of ITS tools.
[2023-03-18 20:39:12] [INFO ] Flatten gal took : 54 ms
[2023-03-18 20:39:12] [INFO ] Applying decomposition
[2023-03-18 20:39:12] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12497561657420216920.txt' '-o' '/tmp/graph12497561657420216920.bin' '-w' '/tmp/graph12497561657420216920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12497561657420216920.bin' '-l' '-1' '-v' '-w' '/tmp/graph12497561657420216920.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:39:12] [INFO ] Decomposing Gal with order
[2023-03-18 20:39:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:39:12] [INFO ] Removed a total of 315 redundant transitions.
[2023-03-18 20:39:12] [INFO ] Flatten gal took : 65 ms
[2023-03-18 20:39:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 16 ms.
[2023-03-18 20:39:12] [INFO ] Time to serialize gal into /tmp/LTL1729231512060427126.gal : 8 ms
[2023-03-18 20:39:12] [INFO ] Time to serialize properties into /tmp/LTL5845640445597795820.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1729231512060427126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5845640445597795820.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(i12.i0.u109.p740!=1)"))))
Formula 0 simplified : GF!"(i12.i0.u109.p740!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13960689773064190410
[2023-03-18 20:39:27] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13960689773064190410
Running compilation step : cd /tmp/ltsmin13960689773064190410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 736 ms.
Running link step : cd /tmp/ltsmin13960689773064190410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin13960689773064190410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-02 finished in 99176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1067 transition count 946
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 860 transition count 840
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 414 place count 860 transition count 839
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 3 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 2 with 712 rules applied. Total rules applied 1128 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 500 transition count 481
Applied a total of 1131 rules in 164 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-18 20:39:43] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:39:43] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-18 20:39:43] [INFO ] Invariant cache hit.
[2023-03-18 20:39:44] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2023-03-18 20:39:44] [INFO ] Redundant transitions in 265 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2023-03-18 20:39:44] [INFO ] Computed 180 place invariants in 4 ms
[2023-03-18 20:39:44] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1068 places, 480/1048 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1754 ms. Remains : 500/1068 places, 480/1048 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s271 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1075 steps with 0 reset in 6 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-06 finished in 1991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((!p0||(p1 U X(p2)))) U X(p2)) U X(G(p3))))'
Support contains 8 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1064 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1064 transition count 1044
Applied a total of 8 rules in 55 ms. Remains 1064 /1068 variables (removed 4) and now considering 1044/1048 (removed 4) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-18 20:39:44] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-18 20:39:45] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-18 20:39:45] [INFO ] Invariant cache hit.
[2023-03-18 20:39:46] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
[2023-03-18 20:39:46] [INFO ] Invariant cache hit.
[2023-03-18 20:39:46] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1068 places, 1044/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2009 ms. Remains : 1064/1068 places, 1044/1048 transitions.
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 6}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 9}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(NOT p2), acceptance={} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 8}, { cond=p3, acceptance={} source=10 dest: 10}]], initial=1, aps=[p0:(OR (EQ s975 0) (EQ s531 1)), p1:(OR (EQ s539 0) (EQ s556 1)), p2:(OR (EQ s200 0) (EQ s966 1)), p3:(OR (EQ s96 0) (EQ s771 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 39955 reset in 682 ms.
Product exploration explored 100000 steps with 40079 reset in 534 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (OR (NOT p0) p1)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (OR (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 2885 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 765 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:39:53] [INFO ] Invariant cache hit.
[2023-03-18 20:39:53] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 20:39:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 95 ms returned sat
[2023-03-18 20:39:55] [INFO ] After 1127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 20:39:55] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 4 ms to minimize.
[2023-03-18 20:39:55] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 1 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 1 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 1 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 16 places in 397 ms of which 14 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 1 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 0 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 1 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 0 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 0 ms to minimize.
[2023-03-18 20:39:59] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 1 ms to minimize.
[2023-03-18 20:39:59] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 1 ms to minimize.
[2023-03-18 20:39:59] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 0 ms to minimize.
[2023-03-18 20:40:00] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 1 ms to minimize.
[2023-03-18 20:40:00] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 0 ms to minimize.
[2023-03-18 20:40:00] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 1 ms to minimize.
[2023-03-18 20:40:00] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 1 ms to minimize.
[2023-03-18 20:40:01] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2023-03-18 20:40:01] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 0 ms to minimize.
[2023-03-18 20:40:01] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 0 ms to minimize.
[2023-03-18 20:40:01] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 1 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 1 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 0 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 1 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 1 ms to minimize.
[2023-03-18 20:40:03] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 1 ms to minimize.
[2023-03-18 20:40:03] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 1 ms to minimize.
[2023-03-18 20:40:03] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 36 ms to minimize.
[2023-03-18 20:40:03] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2023-03-18 20:40:03] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 1 ms to minimize.
[2023-03-18 20:40:04] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 6 ms to minimize.
[2023-03-18 20:40:04] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 0 ms to minimize.
[2023-03-18 20:40:04] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 0 ms to minimize.
[2023-03-18 20:40:04] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2023-03-18 20:40:04] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2023-03-18 20:40:04] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2023-03-18 20:40:05] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-18 20:40:05] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 0 ms to minimize.
[2023-03-18 20:40:05] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 12 ms to minimize.
[2023-03-18 20:40:05] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 2 ms to minimize.
[2023-03-18 20:40:05] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 0 ms to minimize.
[2023-03-18 20:40:06] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 0 ms to minimize.
[2023-03-18 20:40:06] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 10860 ms
[2023-03-18 20:40:06] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2023-03-18 20:40:06] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2023-03-18 20:40:06] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2023-03-18 20:40:06] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 0 ms to minimize.
[2023-03-18 20:40:07] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 15 ms to minimize.
[2023-03-18 20:40:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1002 ms
[2023-03-18 20:40:07] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 0 ms to minimize.
[2023-03-18 20:40:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-18 20:40:07] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 1 ms to minimize.
[2023-03-18 20:40:07] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2023-03-18 20:40:07] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 0 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 5 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 0 ms to minimize.
[2023-03-18 20:40:09] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 0 ms to minimize.
[2023-03-18 20:40:09] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2023-03-18 20:40:09] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 1 ms to minimize.
[2023-03-18 20:40:09] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 0 ms to minimize.
[2023-03-18 20:40:09] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2023-03-18 20:40:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2525 ms
[2023-03-18 20:40:10] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 13 ms to minimize.
[2023-03-18 20:40:10] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2023-03-18 20:40:10] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2023-03-18 20:40:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 603 ms
[2023-03-18 20:40:10] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 0 ms to minimize.
[2023-03-18 20:40:11] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 14 ms to minimize.
[2023-03-18 20:40:11] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2023-03-18 20:40:11] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-18 20:40:11] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2023-03-18 20:40:11] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 0 ms to minimize.
[2023-03-18 20:40:12] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 0 ms to minimize.
[2023-03-18 20:40:12] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 1 ms to minimize.
[2023-03-18 20:40:12] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2023-03-18 20:40:12] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2023-03-18 20:40:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2107 ms
[2023-03-18 20:40:12] [INFO ] After 18804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 351 ms.
[2023-03-18 20:40:13] [INFO ] After 19710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 192 ms.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1064 transition count 944
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 964 transition count 944
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 964 transition count 842
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 862 transition count 842
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1102 place count 513 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 2 with 137 rules applied. Total rules applied 1239 place count 513 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1240 place count 512 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1241 place count 511 transition count 492
Applied a total of 1241 rules in 89 ms. Remains 511 /1064 variables (removed 553) and now considering 492/1044 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 511/1064 places, 492/1044 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 492 rows 511 cols
[2023-03-18 20:40:13] [INFO ] Computed 180 place invariants in 12 ms
[2023-03-18 20:40:13] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:40:13] [INFO ] [Nat]Absence check using 179 positive place invariants in 23 ms returned sat
[2023-03-18 20:40:13] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 20:40:14] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:40:14] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2023-03-18 20:40:14] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2023-03-18 20:40:14] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-18 20:40:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 363 ms
[2023-03-18 20:40:14] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 0 ms to minimize.
[2023-03-18 20:40:14] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-18 20:40:15] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-18 20:40:15] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2023-03-18 20:40:15] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2023-03-18 20:40:15] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-18 20:40:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 712 ms
[2023-03-18 20:40:15] [INFO ] After 1406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-18 20:40:15] [INFO ] After 1561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 9 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 511/511 places, 492/492 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First 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 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 200857 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200857 steps, saw 143871 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:40:18] [INFO ] Invariant cache hit.
[2023-03-18 20:40:18] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:40:18] [INFO ] [Nat]Absence check using 179 positive place invariants in 41 ms returned sat
[2023-03-18 20:40:18] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:40:19] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:40:19] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-18 20:40:19] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2023-03-18 20:40:19] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 0 ms to minimize.
[2023-03-18 20:40:19] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 0 ms to minimize.
[2023-03-18 20:40:19] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2023-03-18 20:40:19] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-18 20:40:20] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-18 20:40:20] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 0 ms to minimize.
[2023-03-18 20:40:20] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 1 ms to minimize.
[2023-03-18 20:40:20] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-18 20:40:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1505 ms
[2023-03-18 20:40:20] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2023-03-18 20:40:20] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-18 20:40:21] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-18 20:40:21] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 0 ms to minimize.
[2023-03-18 20:40:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 627 ms
[2023-03-18 20:40:21] [INFO ] After 2399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-18 20:40:21] [INFO ] After 2592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 8 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 16 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 511/511 places, 492/492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 13 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
[2023-03-18 20:40:21] [INFO ] Invariant cache hit.
[2023-03-18 20:40:21] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-18 20:40:21] [INFO ] Invariant cache hit.
[2023-03-18 20:40:22] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2023-03-18 20:40:22] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-18 20:40:22] [INFO ] Invariant cache hit.
[2023-03-18 20:40:22] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1241 ms. Remains : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 8 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 20:40:22] [INFO ] Invariant cache hit.
[2023-03-18 20:40:22] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:40:22] [INFO ] [Nat]Absence check using 179 positive place invariants in 31 ms returned sat
[2023-03-18 20:40:22] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 20:40:23] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:40:23] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-18 20:40:23] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2023-03-18 20:40:23] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2023-03-18 20:40:23] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-03-18 20:40:23] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2023-03-18 20:40:24] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-18 20:40:24] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-18 20:40:24] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2023-03-18 20:40:24] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2023-03-18 20:40:24] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-03-18 20:40:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1479 ms
[2023-03-18 20:40:24] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2023-03-18 20:40:25] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-18 20:40:25] [INFO ] Deduced a trap composed of 8 places in 369 ms of which 1 ms to minimize.
[2023-03-18 20:40:25] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-18 20:40:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 837 ms
[2023-03-18 20:40:25] [INFO ] After 2674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-18 20:40:25] [INFO ] After 2946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2 p3), (X (OR (NOT p0) p1)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (OR (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND p1 p0 (NOT p3))), (F (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) p0 (NOT p3))), (F (AND (NOT p1) p0 (NOT p3))), (F (NOT p2)), (F (NOT p3)), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (NOT (OR p1 (NOT p0)))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2) (NOT p0) p3)), (F (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 36 factoid took 3503 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 606 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 570 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 35 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-18 20:40:30] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-18 20:40:30] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-18 20:40:30] [INFO ] Invariant cache hit.
[2023-03-18 20:40:31] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2023-03-18 20:40:31] [INFO ] Invariant cache hit.
[2023-03-18 20:40:32] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1978 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0) p3))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) p3))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR p1 (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 2488 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 694 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:40:36] [INFO ] Invariant cache hit.
[2023-03-18 20:40:36] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 20:40:36] [INFO ] [Nat]Absence check using 181 positive place invariants in 84 ms returned sat
[2023-03-18 20:40:37] [INFO ] After 875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 20:40:38] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 0 ms to minimize.
[2023-03-18 20:40:38] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 14 ms to minimize.
[2023-03-18 20:40:38] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 1 ms to minimize.
[2023-03-18 20:40:39] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 0 ms to minimize.
[2023-03-18 20:40:39] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 0 ms to minimize.
[2023-03-18 20:40:39] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 1 ms to minimize.
[2023-03-18 20:40:39] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 1 ms to minimize.
[2023-03-18 20:40:40] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 0 ms to minimize.
[2023-03-18 20:40:40] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2023-03-18 20:40:40] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
[2023-03-18 20:40:40] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 1 ms to minimize.
[2023-03-18 20:40:41] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
[2023-03-18 20:40:41] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-18 20:40:41] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 0 ms to minimize.
[2023-03-18 20:40:41] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2023-03-18 20:40:42] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 1 ms to minimize.
[2023-03-18 20:40:42] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 1 ms to minimize.
[2023-03-18 20:40:42] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 1 ms to minimize.
[2023-03-18 20:40:42] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 1 ms to minimize.
[2023-03-18 20:40:43] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 0 ms to minimize.
[2023-03-18 20:40:43] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 0 ms to minimize.
[2023-03-18 20:40:43] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2023-03-18 20:40:43] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:40:43] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 0 ms to minimize.
[2023-03-18 20:40:44] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2023-03-18 20:40:44] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 1 ms to minimize.
[2023-03-18 20:40:44] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 0 ms to minimize.
[2023-03-18 20:40:44] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 1 ms to minimize.
[2023-03-18 20:40:44] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-03-18 20:40:45] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 1 ms to minimize.
[2023-03-18 20:40:45] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 0 ms to minimize.
[2023-03-18 20:40:45] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 0 ms to minimize.
[2023-03-18 20:40:45] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 1 ms to minimize.
[2023-03-18 20:40:45] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2023-03-18 20:40:46] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2023-03-18 20:40:46] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2023-03-18 20:40:46] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8615 ms
[2023-03-18 20:40:46] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 0 ms to minimize.
[2023-03-18 20:40:46] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 0 ms to minimize.
[2023-03-18 20:40:47] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 1 ms to minimize.
[2023-03-18 20:40:47] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 1 ms to minimize.
[2023-03-18 20:40:47] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2023-03-18 20:40:47] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2023-03-18 20:40:48] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 1 ms to minimize.
[2023-03-18 20:40:48] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2023-03-18 20:40:48] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 1 ms to minimize.
[2023-03-18 20:40:48] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2023-03-18 20:40:48] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2023-03-18 20:40:49] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
[2023-03-18 20:40:49] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2023-03-18 20:40:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2778 ms
[2023-03-18 20:40:49] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2023-03-18 20:40:49] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 1 ms to minimize.
[2023-03-18 20:40:49] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2023-03-18 20:40:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 617 ms
[2023-03-18 20:40:50] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 1 ms to minimize.
[2023-03-18 20:40:50] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2023-03-18 20:40:50] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 1 ms to minimize.
[2023-03-18 20:40:50] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2023-03-18 20:40:51] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 0 ms to minimize.
[2023-03-18 20:40:51] [INFO ] Deduced a trap composed of 22 places in 323 ms of which 1 ms to minimize.
[2023-03-18 20:40:51] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2023-03-18 20:40:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1766 ms
[2023-03-18 20:40:52] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2023-03-18 20:40:52] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 1 ms to minimize.
[2023-03-18 20:40:52] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 1 ms to minimize.
[2023-03-18 20:40:53] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 1 ms to minimize.
[2023-03-18 20:40:53] [INFO ] Deduced a trap composed of 36 places in 301 ms of which 1 ms to minimize.
[2023-03-18 20:40:53] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 1 ms to minimize.
[2023-03-18 20:40:53] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 0 ms to minimize.
[2023-03-18 20:40:54] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2023-03-18 20:40:54] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 0 ms to minimize.
[2023-03-18 20:40:54] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2023-03-18 20:40:54] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 1 ms to minimize.
[2023-03-18 20:40:55] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 0 ms to minimize.
[2023-03-18 20:40:55] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 0 ms to minimize.
[2023-03-18 20:40:55] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2023-03-18 20:40:55] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3746 ms
[2023-03-18 20:40:56] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 1 ms to minimize.
[2023-03-18 20:40:56] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 1 ms to minimize.
[2023-03-18 20:40:56] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 1 ms to minimize.
[2023-03-18 20:40:56] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 1 ms to minimize.
[2023-03-18 20:40:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1097 ms
[2023-03-18 20:40:57] [INFO ] After 20203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 587 ms.
[2023-03-18 20:40:57] [INFO ] After 21443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 163 ms.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1064 transition count 944
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 964 transition count 944
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 964 transition count 842
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 862 transition count 842
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 0 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1102 place count 513 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 2 with 137 rules applied. Total rules applied 1239 place count 513 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1240 place count 512 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1241 place count 511 transition count 492
Applied a total of 1241 rules in 82 ms. Remains 511 /1064 variables (removed 553) and now considering 492/1044 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 511/1064 places, 492/1044 transitions.
Finished random walk after 9548 steps, including 2 resets, run visited all 8 properties in 133 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND p1 p2 p0 p3), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0) p3))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) p3))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR p1 (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p2) p3 (NOT p0) (NOT p1))), (F (AND (NOT p3) p0 p1)), (F (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1))), (F (AND (NOT p2) (NOT p3) p0 p1)), (F (AND (NOT p3) p0 (NOT p1))), (F (NOT p2)), (F (NOT p3)), (F (AND (NOT p2) (NOT p3) (NOT p0) p1)), (F (NOT (OR (NOT p0) p1))), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p3) p0 (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p2) p3 (NOT p0) p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))]
Knowledge based reduction with 36 factoid took 2998 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 671 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 771 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 694 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 40026 reset in 561 ms.
Product exploration explored 100000 steps with 39978 reset in 592 ms.
Applying partial POR strategy [false, false, true, false, true, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 699 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1064 transition count 1044
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 99 place count 1064 transition count 1046
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 141 place count 1064 transition count 1046
Performed 410 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 551 places in 0 ms
Iterating global reduction 1 with 410 rules applied. Total rules applied 551 place count 1064 transition count 1046
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 692 place count 923 transition count 905
Deduced a syphon composed of 410 places in 1 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 833 place count 923 transition count 905
Deduced a syphon composed of 410 places in 0 ms
Applied a total of 833 rules in 384 ms. Remains 923 /1064 variables (removed 141) and now considering 905/1044 (removed 139) transitions.
[2023-03-18 20:41:05] [INFO ] Redundant transitions in 78 ms returned [904]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 904 rows 923 cols
[2023-03-18 20:41:05] [INFO ] Computed 181 place invariants in 11 ms
[2023-03-18 20:41:06] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1064 places, 904/1044 transitions.
Deduced a syphon composed of 410 places in 1 ms
Applied a total of 0 rules in 18 ms. Remains 923 /923 variables (removed 0) and now considering 904/904 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 979 ms. Remains : 923/1064 places, 904/1044 transitions.
Built C files in :
/tmp/ltsmin6236624043541196743
[2023-03-18 20:41:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6236624043541196743
Running compilation step : cd /tmp/ltsmin6236624043541196743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1686 ms.
Running link step : cd /tmp/ltsmin6236624043541196743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin6236624043541196743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17099436184171644911.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 39 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-18 20:41:21] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-18 20:41:21] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-18 20:41:21] [INFO ] Invariant cache hit.
[2023-03-18 20:41:22] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2023-03-18 20:41:22] [INFO ] Invariant cache hit.
[2023-03-18 20:41:23] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2056 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Built C files in :
/tmp/ltsmin16647356570768031800
[2023-03-18 20:41:23] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16647356570768031800
Running compilation step : cd /tmp/ltsmin16647356570768031800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1700 ms.
Running link step : cd /tmp/ltsmin16647356570768031800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin16647356570768031800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17026119649566108850.hoa' '--buchi-type=spotba'
LTSmin run took 3186 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-09 finished in 103596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&F(p2))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 50 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-18 20:41:28] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-18 20:41:28] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-18 20:41:28] [INFO ] Invariant cache hit.
[2023-03-18 20:41:29] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
[2023-03-18 20:41:29] [INFO ] Invariant cache hit.
[2023-03-18 20:41:30] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2021 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s53 0) (EQ s316 1) (EQ s3 1)), p2:(EQ s3 1), p0:(OR (EQ s316 0) (EQ s740 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11519 reset in 320 ms.
Product exploration explored 100000 steps with 11652 reset in 354 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (AND p1 (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 599 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p2)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (AND p1 (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 516 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
[2023-03-18 20:41:32] [INFO ] Invariant cache hit.
[2023-03-18 20:41:33] [INFO ] [Real]Absence check using 181 positive place invariants in 224 ms returned sat
[2023-03-18 20:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:41:37] [INFO ] [Real]Absence check using state equation in 4215 ms returned sat
[2023-03-18 20:41:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:41:38] [INFO ] [Nat]Absence check using 181 positive place invariants in 57 ms returned sat
[2023-03-18 20:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:41:40] [INFO ] [Nat]Absence check using state equation in 1806 ms returned sat
[2023-03-18 20:41:40] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 99 ms.
[2023-03-18 20:41:50] [INFO ] Added : 423 causal constraints over 87 iterations in 10147 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 1062 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 : 1062/1062 places, 1042/1042 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1061 transition count 942
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 962 transition count 841
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 861 transition count 841
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1110 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1112 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1113 place count 503 transition count 484
Applied a total of 1113 rules in 107 ms. Remains 503 /1062 variables (removed 559) and now considering 484/1042 (removed 558) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-18 20:41:50] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-18 20:41:50] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-18 20:41:50] [INFO ] Invariant cache hit.
[2023-03-18 20:41:51] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-18 20:41:51] [INFO ] Redundant transitions in 62 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-18 20:41:51] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-18 20:41:51] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1062 places, 483/1042 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1339 ms. Remains : 503/1062 places, 483/1042 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p2)]
[2023-03-18 20:41:52] [INFO ] Invariant cache hit.
[2023-03-18 20:41:52] [INFO ] [Real]Absence check using 180 positive place invariants in 53 ms returned sat
[2023-03-18 20:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:41:53] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2023-03-18 20:41:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:41:53] [INFO ] [Nat]Absence check using 180 positive place invariants in 30 ms returned sat
[2023-03-18 20:41:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:41:53] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2023-03-18 20:41:54] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 0 ms to minimize.
[2023-03-18 20:41:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-18 20:41:54] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 68 ms.
[2023-03-18 20:41:55] [INFO ] Added : 109 causal constraints over 22 iterations in 1620 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Product exploration explored 100000 steps with 27693 reset in 257 ms.
Product exploration explored 100000 steps with 27506 reset in 280 ms.
Built C files in :
/tmp/ltsmin2709504307655011947
[2023-03-18 20:41:56] [INFO ] Computing symmetric may disable matrix : 483 transitions.
[2023-03-18 20:41:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:56] [INFO ] Computing symmetric may enable matrix : 483 transitions.
[2023-03-18 20:41:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:56] [INFO ] Computing Do-Not-Accords matrix : 483 transitions.
[2023-03-18 20:41:56] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:41:56] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2709504307655011947
Running compilation step : cd /tmp/ltsmin2709504307655011947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1057 ms.
Running link step : cd /tmp/ltsmin2709504307655011947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin2709504307655011947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4333665176255787053.hoa' '--buchi-type=spotba'
LTSmin run took 3386 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 32396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(((p1 U X(p2))||(F(p3) U !p0))))))'
Support contains 7 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1064 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1064 transition count 1044
Applied a total of 8 rules in 42 ms. Remains 1064 /1068 variables (removed 4) and now considering 1044/1048 (removed 4) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-18 20:42:00] [INFO ] Computed 181 place invariants in 6 ms
[2023-03-18 20:42:01] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-18 20:42:01] [INFO ] Invariant cache hit.
[2023-03-18 20:42:02] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2023-03-18 20:42:02] [INFO ] Invariant cache hit.
[2023-03-18 20:42:02] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1068 places, 1044/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2080 ms. Remains : 1064/1068 places, 1044/1048 transitions.
Stuttering acceptance computed with spot in 587 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), p0]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s671 1), p1:(OR (EQ s65 0) (EQ s14 1)), p3:(OR (EQ s442 0) (EQ s297 1)), p2:(OR (EQ s836 0) (EQ s690 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-12 finished in 2693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(F(p1)&&X(X(G(p2)))))))'
Support contains 5 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1043
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1043
Applied a total of 10 rules in 100 ms. Remains 1063 /1068 variables (removed 5) and now considering 1043/1048 (removed 5) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2023-03-18 20:42:03] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-18 20:42:04] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-18 20:42:04] [INFO ] Invariant cache hit.
[2023-03-18 20:42:05] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2023-03-18 20:42:05] [INFO ] Invariant cache hit.
[2023-03-18 20:42:05] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1068 places, 1043/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2053 ms. Remains : 1063/1068 places, 1043/1048 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (NEQ s15 0) (NEQ s274 1)), p1:(AND (EQ s118 0) (EQ s627 1)), p2:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1675 steps with 0 reset in 14 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-13 finished in 2327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-18 20:42:06] [INFO ] Flatten gal took : 74 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9940698458253033540
[2023-03-18 20:42:06] [INFO ] Computing symmetric may disable matrix : 1048 transitions.
[2023-03-18 20:42:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:42:06] [INFO ] Computing symmetric may enable matrix : 1048 transitions.
[2023-03-18 20:42:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:42:06] [INFO ] Applying decomposition
[2023-03-18 20:42:06] [INFO ] Flatten gal took : 56 ms
[2023-03-18 20:42:06] [INFO ] Computing Do-Not-Accords matrix : 1048 transitions.
[2023-03-18 20:42:06] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 20:42:06] [INFO ] Built C files in 198ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9940698458253033540
Running compilation step : cd /tmp/ltsmin9940698458253033540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6386404836555413836.txt' '-o' '/tmp/graph6386404836555413836.bin' '-w' '/tmp/graph6386404836555413836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6386404836555413836.bin' '-l' '-1' '-v' '-w' '/tmp/graph6386404836555413836.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:42:06] [INFO ] Decomposing Gal with order
[2023-03-18 20:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:42:06] [INFO ] Removed a total of 460 redundant transitions.
[2023-03-18 20:42:06] [INFO ] Flatten gal took : 72 ms
[2023-03-18 20:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2023-03-18 20:42:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality9306430497556474512.gal : 20 ms
[2023-03-18 20:42:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality7396984343871413484.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9306430497556474512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7396984343871413484.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(i12.i2.u249.p740!=1)"))))
Formula 0 simplified : GF!"(i12.i2.u249.p740!=1)"
Compilation finished in 2801 ms.
Running link step : cd /tmp/ltsmin9940698458253033540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9940698458253033540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 21:03:29] [INFO ] Applying decomposition
[2023-03-18 21:03:29] [INFO ] Flatten gal took : 76 ms
[2023-03-18 21:03:29] [INFO ] Decomposing Gal with order
[2023-03-18 21:03:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:03:29] [INFO ] Removed a total of 320 redundant transitions.
[2023-03-18 21:03:29] [INFO ] Flatten gal took : 155 ms
[2023-03-18 21:03:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 68 ms.
[2023-03-18 21:03:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality9444839883321682393.gal : 33 ms
[2023-03-18 21:03:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality13979528927106886192.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9444839883321682393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13979528927106886192.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u232.p740!=1)"))))
Formula 0 simplified : GF!"(i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u232.p740!=1)"
Detected timeout of ITS tools.
[2023-03-18 21:24:54] [INFO ] Flatten gal took : 543 ms
[2023-03-18 21:24:57] [INFO ] Input system was already deterministic with 1048 transitions.
[2023-03-18 21:24:58] [INFO ] Transformed 1068 places.
[2023-03-18 21:24:58] [INFO ] Transformed 1048 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-03-18 21:24:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality14801765147662050444.gal : 5 ms
[2023-03-18 21:24:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality18077385793521580748.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14801765147662050444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18077385793521580748.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.202303021504/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 : !((F(G("(p740!=1)"))))
Formula 0 simplified : GF!"(p740!=1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 7274328 kB
After kill :
MemTotal: 16393236 kB
MemFree: 15857456 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-020B"
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 ShieldIIPs-PT-020B, 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 r389-oct2-167903713100107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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