Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 22K Apr 30 08:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 172K Apr 30 08:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 30 08:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 188K Apr 30 08:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.6K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 9 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 9 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 9 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 9 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 552K May 10 09:33 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 FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652718313708

Running Version 202205111006
[2022-05-16 16:25:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 16:25:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:25:15] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2022-05-16 16:25:15] [INFO ] Transformed 1475 places.
[2022-05-16 16:25:15] [INFO ] Transformed 1234 transitions.
[2022-05-16 16:25:15] [INFO ] Parsed PT model containing 1475 places and 1234 transitions in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 1465 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Reduce places removed 43 places and 0 transitions.
Discarding 131 places :
Implicit places reduction removed 131 places
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 1291 transition count 1234
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 290 place count 1175 transition count 1108
Iterating global reduction 1 with 116 rules applied. Total rules applied 406 place count 1175 transition count 1108
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 417 place count 1164 transition count 1108
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 448 place count 1133 transition count 1067
Iterating global reduction 2 with 31 rules applied. Total rules applied 479 place count 1133 transition count 1067
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 490 place count 1122 transition count 1067
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 511 place count 1101 transition count 1046
Iterating global reduction 3 with 21 rules applied. Total rules applied 532 place count 1101 transition count 1046
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 543 place count 1090 transition count 1035
Iterating global reduction 3 with 11 rules applied. Total rules applied 554 place count 1090 transition count 1035
Applied a total of 554 rules in 422 ms. Remains 1090 /1465 variables (removed 375) and now considering 1035/1234 (removed 199) transitions.
// Phase 1: matrix 1035 rows 1090 cols
[2022-05-16 16:25:15] [INFO ] Computed 150 place invariants in 50 ms
[2022-05-16 16:25:16] [INFO ] Implicit Places using invariants in 572 ms returned [77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 836, 837, 838, 839, 840, 841, 842, 843, 845, 846, 990]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 606 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1024/1465 places, 1035/1234 transitions.
Applied a total of 0 rules in 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1024/1465 places, 1035/1234 transitions.
Support contains 64 out of 1024 places after structural reductions.
[2022-05-16 16:25:16] [INFO ] Flatten gal took : 148 ms
[2022-05-16 16:25:16] [INFO ] Flatten gal took : 69 ms
[2022-05-16 16:25:17] [INFO ] Input system was already deterministic with 1035 transitions.
Support contains 62 out of 1024 places (down from 64) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1035 rows 1024 cols
[2022-05-16 16:25:17] [INFO ] Computed 84 place invariants in 26 ms
[2022-05-16 16:25:17] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 16:25:17] [INFO ] [Real]Absence check using 4 positive and 80 generalized place invariants in 36 ms returned sat
[2022-05-16 16:25:17] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-16 16:25:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-05-16 16:25:18] [INFO ] [Nat]Absence check using 4 positive and 80 generalized place invariants in 32 ms returned sat
[2022-05-16 16:25:18] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-16 16:25:18] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-05-16 16:25:18] [INFO ] After 760ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 525 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=105 )
Parikh walk visited 1 properties in 6 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1024 stabilizing places and 1035 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 1035
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X(p0)))&&F(G(F(X(p0))))))'
Support contains 11 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 1035/1035 transitions.
Graph (complete) has 1349 edges and 1024 vertex of which 400 are kept as prefixes of interest. Removing 624 places using SCC suffix rule.8 ms
Discarding 624 places :
Also discarding 616 output transitions
Drop transitions removed 616 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 321 rules applied. Total rules applied 322 place count 388 transition count 88
Reduce places removed 320 places and 0 transitions.
Iterating post reduction 1 with 320 rules applied. Total rules applied 642 place count 68 transition count 88
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 642 place count 68 transition count 66
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 686 place count 46 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 687 place count 45 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 45 transition count 55
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 699 place count 45 transition count 44
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 710 place count 34 transition count 33
Applied a total of 710 rules in 31 ms. Remains 34 /1024 variables (removed 990) and now considering 33/1035 (removed 1002) transitions.
// Phase 1: matrix 33 rows 34 cols
[2022-05-16 16:25:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 16:25:18] [INFO ] Implicit Places using invariants in 36 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/1024 places, 33/1035 transitions.
Reduce places removed 11 places and 11 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /33 variables (removed 11) and now considering 22/33 (removed 11) transitions.
Finished structural reductions, in 2 iterations. Remains : 22/1024 places, 22/1035 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5883 reset in 377 ms.
Product exploration explored 100000 steps with 5877 reset in 176 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-02 finished in 1016 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F((F(p1)&&p0))))'
Support contains 33 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 1035/1035 transitions.
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1021 transition count 1035
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 1002 transition count 1015
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 1002 transition count 1015
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 52 place count 1002 transition count 1004
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 999 transition count 981
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 999 transition count 981
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 81 place count 976 transition count 948
Iterating global reduction 2 with 23 rules applied. Total rules applied 104 place count 976 transition count 948
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 127 place count 953 transition count 915
Iterating global reduction 2 with 23 rules applied. Total rules applied 150 place count 953 transition count 915
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 161 place count 953 transition count 904
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 172 place count 942 transition count 893
Iterating global reduction 3 with 11 rules applied. Total rules applied 183 place count 942 transition count 893
Applied a total of 183 rules in 181 ms. Remains 942 /1024 variables (removed 82) and now considering 893/1035 (removed 142) transitions.
// Phase 1: matrix 893 rows 942 cols
[2022-05-16 16:25:20] [INFO ] Computed 82 place invariants in 20 ms
[2022-05-16 16:25:20] [INFO ] Implicit Places using invariants in 247 ms returned [176, 453, 509, 699]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 252 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 938/1024 places, 893/1035 transitions.
Applied a total of 0 rules in 29 ms. Remains 938 /938 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 938/1024 places, 893/1035 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428)), p1:(GT 1 (ADD s474 s475 s4...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1373 reset in 267 ms.
Product exploration explored 100000 steps with 1355 reset in 275 ms.
Computed a total of 938 stabilizing places and 893 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 893
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 389 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:21] [INFO ] Computed 78 place invariants in 9 ms
[2022-05-16 16:25:21] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 23 ms returned sat
[2022-05-16 16:25:22] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:25:22] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 28 ms returned sat
[2022-05-16 16:25:22] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:25:23] [INFO ] After 508ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-16 16:25:23] [INFO ] After 735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=162 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:23] [INFO ] Computed 78 place invariants in 11 ms
[2022-05-16 16:25:24] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 29 ms returned sat
[2022-05-16 16:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:24] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2022-05-16 16:25:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:25:25] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 30 ms returned sat
[2022-05-16 16:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:25] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2022-05-16 16:25:25] [INFO ] Computed and/alt/rep : 880/990/880 causal constraints (skipped 2 transitions) in 48 ms.
[2022-05-16 16:25:27] [INFO ] Added : 99 causal constraints over 20 iterations in 1139 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 33 out of 938 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 938/938 places, 893/893 transitions.
Applied a total of 0 rules in 29 ms. Remains 938 /938 variables (removed 0) and now considering 893/893 (removed 0) transitions.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:27] [INFO ] Computed 78 place invariants in 6 ms
[2022-05-16 16:25:27] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:27] [INFO ] Computed 78 place invariants in 7 ms
[2022-05-16 16:25:27] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:27] [INFO ] Computed 78 place invariants in 9 ms
[2022-05-16 16:25:28] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 938/938 places, 893/893 transitions.
Computed a total of 938 stabilizing places and 893 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 938 transition count 893
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 285 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:28] [INFO ] Computed 78 place invariants in 8 ms
[2022-05-16 16:25:29] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 30 ms returned sat
[2022-05-16 16:25:29] [INFO ] After 587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 16:25:29] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 27 ms returned sat
[2022-05-16 16:25:30] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 16:25:30] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2022-05-16 16:25:30] [INFO ] After 699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 162 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 364 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:30] [INFO ] Computed 78 place invariants in 8 ms
[2022-05-16 16:25:31] [INFO ] [Real]Absence check using 0 positive and 78 generalized place invariants in 29 ms returned sat
[2022-05-16 16:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:31] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2022-05-16 16:25:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:25:32] [INFO ] [Nat]Absence check using 0 positive and 78 generalized place invariants in 32 ms returned sat
[2022-05-16 16:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:25:32] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2022-05-16 16:25:32] [INFO ] Computed and/alt/rep : 880/990/880 causal constraints (skipped 2 transitions) in 44 ms.
[2022-05-16 16:25:33] [INFO ] Added : 99 causal constraints over 20 iterations in 987 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1366 reset in 210 ms.
Product exploration explored 100000 steps with 1358 reset in 221 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 33 out of 938 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 938/938 places, 893/893 transitions.
Graph (complete) has 1079 edges and 938 vertex of which 936 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 308 rules applied. Total rules applied 309 place count 936 transition count 891
Performed 330 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 330 Pre rules applied. Total rules applied 309 place count 936 transition count 957
Deduced a syphon composed of 638 places in 0 ms
Iterating global reduction 1 with 330 rules applied. Total rules applied 639 place count 936 transition count 957
Discarding 407 places :
Symmetric choice reduction at 1 with 407 rule applications. Total rules 1046 place count 529 transition count 550
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 1 with 407 rules applied. Total rules applied 1453 place count 529 transition count 550
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 1475 place count 529 transition count 528
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1475 place count 529 transition count 528
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 1486 place count 529 transition count 528
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 1497 place count 518 transition count 528
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1508 place count 507 transition count 517
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1519 place count 507 transition count 517
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 297 places in 0 ms
Iterating global reduction 3 with 55 rules applied. Total rules applied 1574 place count 507 transition count 517
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 1618 place count 463 transition count 473
Deduced a syphon composed of 253 places in 0 ms
Iterating global reduction 3 with 44 rules applied. Total rules applied 1662 place count 463 transition count 473
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 264 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1673 place count 463 transition count 506
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1684 place count 452 transition count 484
Deduced a syphon composed of 253 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 1695 place count 452 transition count 484
Deduced a syphon composed of 253 places in 0 ms
Applied a total of 1695 rules in 189 ms. Remains 452 /938 variables (removed 486) and now considering 484/893 (removed 409) transitions.
[2022-05-16 16:25:34] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 484 rows 452 cols
[2022-05-16 16:25:34] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 16:25:35] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 452/938 places, 484/893 transitions.
Finished structural reductions, in 1 iterations. Remains : 452/938 places, 484/893 transitions.
Product exploration explored 100000 steps with 12627 reset in 631 ms.
Product exploration explored 100000 steps with 12627 reset in 607 ms.
Built C files in :
/tmp/ltsmin17035711280988954916
[2022-05-16 16:25:36] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17035711280988954916
Running compilation step : cd /tmp/ltsmin17035711280988954916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1470 ms.
Running link step : cd /tmp/ltsmin17035711280988954916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17035711280988954916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3310324638777463299.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 33 out of 938 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 938/938 places, 893/893 transitions.
Applied a total of 0 rules in 19 ms. Remains 938 /938 variables (removed 0) and now considering 893/893 (removed 0) transitions.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:51] [INFO ] Computed 78 place invariants in 9 ms
[2022-05-16 16:25:51] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:51] [INFO ] Computed 78 place invariants in 6 ms
[2022-05-16 16:25:52] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
// Phase 1: matrix 893 rows 938 cols
[2022-05-16 16:25:52] [INFO ] Computed 78 place invariants in 7 ms
[2022-05-16 16:25:52] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 938/938 places, 893/893 transitions.
Built C files in :
/tmp/ltsmin10868969615445548825
[2022-05-16 16:25:52] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10868969615445548825
Running compilation step : cd /tmp/ltsmin10868969615445548825;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1289 ms.
Running link step : cd /tmp/ltsmin10868969615445548825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10868969615445548825;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16671729393104097627.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 16:26:07] [INFO ] Flatten gal took : 32 ms
[2022-05-16 16:26:07] [INFO ] Flatten gal took : 30 ms
[2022-05-16 16:26:07] [INFO ] Time to serialize gal into /tmp/LTL11066287321879399613.gal : 6 ms
[2022-05-16 16:26:07] [INFO ] Time to serialize properties into /tmp/LTL3490785340918703489.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11066287321879399613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3490785340918703489.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1106628...267
Read 1 LTL properties
Checking formula 0 : !(((F(X("((((((ml2_0_0+ml2_1_0)+(ml2_2_0+ml2_3_0))+((ml2_4_0+ml2_5_0)+(ml2_6_0+ml2_7_0)))+(((ml2_8_0+ml2_9_0)+(ml2_10_0+ml2_0_1))+((ml...594
Formula 0 simplified : !(FX"((((((ml2_0_0+ml2_1_0)+(ml2_2_0+ml2_3_0))+((ml2_4_0+ml2_5_0)+(ml2_6_0+ml2_7_0)))+(((ml2_8_0+ml2_9_0)+(ml2_10_0+ml2_0_1))+((ml2_...582
Detected timeout of ITS tools.
[2022-05-16 16:26:23] [INFO ] Flatten gal took : 32 ms
[2022-05-16 16:26:23] [INFO ] Applying decomposition
[2022-05-16 16:26:23] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13840228103425864034.txt' '-o' '/tmp/graph13840228103425864034.bin' '-w' '/tmp/graph13840228103425864034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13840228103425864034.bin' '-l' '-1' '-v' '-w' '/tmp/graph13840228103425864034.weights' '-q' '0' '-e' '0.001'
[2022-05-16 16:26:23] [INFO ] Decomposing Gal with order
[2022-05-16 16:26:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:26:23] [INFO ] Removed a total of 36 redundant transitions.
[2022-05-16 16:26:23] [INFO ] Flatten gal took : 96 ms
[2022-05-16 16:26:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 17 ms.
[2022-05-16 16:26:23] [INFO ] Time to serialize gal into /tmp/LTL770223812049323053.gal : 8 ms
[2022-05-16 16:26:23] [INFO ] Time to serialize properties into /tmp/LTL14377987342850909106.ltl : 40 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL770223812049323053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14377987342850909106.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7702238...266
Read 1 LTL properties
Checking formula 0 : !(((F(X("((((((gu181.ml2_0_0+gu181.ml2_1_0)+(gu181.ml2_2_0+gu181.ml2_3_0))+((gu181.ml2_4_0+gu181.ml2_5_0)+(gu181.ml2_6_0+gu181.ml2_7_0...979
Formula 0 simplified : !(FX"((((((gu181.ml2_0_0+gu181.ml2_1_0)+(gu181.ml2_2_0+gu181.ml2_3_0))+((gu181.ml2_4_0+gu181.ml2_5_0)+(gu181.ml2_6_0+gu181.ml2_7_0))...967
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5540085690655994923
[2022-05-16 16:26:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5540085690655994923
Running compilation step : cd /tmp/ltsmin5540085690655994923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1286 ms.
Running link step : cd /tmp/ltsmin5540085690655994923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5540085690655994923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(X((LTLAPp0==true)))&&<>((<>((LTLAPp1==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 finished in 93962 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U p1))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 1035/1035 transitions.
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1021 transition count 1035
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 1002 transition count 1015
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 1002 transition count 1015
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 52 place count 1002 transition count 1004
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 999 transition count 981
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 999 transition count 981
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 81 place count 976 transition count 948
Iterating global reduction 2 with 23 rules applied. Total rules applied 104 place count 976 transition count 948
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 127 place count 953 transition count 915
Iterating global reduction 2 with 23 rules applied. Total rules applied 150 place count 953 transition count 915
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 161 place count 953 transition count 904
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 171 place count 943 transition count 894
Iterating global reduction 3 with 10 rules applied. Total rules applied 181 place count 943 transition count 894
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 191 place count 933 transition count 884
Iterating global reduction 3 with 10 rules applied. Total rules applied 201 place count 933 transition count 884
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 211 place count 923 transition count 874
Iterating global reduction 3 with 10 rules applied. Total rules applied 221 place count 923 transition count 874
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 231 place count 913 transition count 864
Iterating global reduction 3 with 10 rules applied. Total rules applied 241 place count 913 transition count 864
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 251 place count 903 transition count 854
Iterating global reduction 3 with 10 rules applied. Total rules applied 261 place count 903 transition count 854
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 271 place count 893 transition count 844
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 893 transition count 844
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 291 place count 883 transition count 834
Iterating global reduction 3 with 10 rules applied. Total rules applied 301 place count 883 transition count 834
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 311 place count 873 transition count 824
Iterating global reduction 3 with 10 rules applied. Total rules applied 321 place count 873 transition count 824
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 331 place count 863 transition count 814
Iterating global reduction 3 with 10 rules applied. Total rules applied 341 place count 863 transition count 814
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 351 place count 853 transition count 804
Iterating global reduction 3 with 10 rules applied. Total rules applied 361 place count 853 transition count 804
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 371 place count 843 transition count 794
Iterating global reduction 3 with 10 rules applied. Total rules applied 381 place count 843 transition count 794
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 391 place count 843 transition count 784
Applied a total of 391 rules in 355 ms. Remains 843 /1024 variables (removed 181) and now considering 784/1035 (removed 251) transitions.
// Phase 1: matrix 784 rows 843 cols
[2022-05-16 16:26:54] [INFO ] Computed 82 place invariants in 13 ms
[2022-05-16 16:26:54] [INFO ] Implicit Places using invariants in 254 ms returned [146, 354, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 410, 600]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 256 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/1024 places, 784/1035 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 807 transition count 763
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 807 transition count 763
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 797 transition count 743
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 797 transition count 743
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 787 transition count 733
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 787 transition count 733
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 777 transition count 723
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 777 transition count 723
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 767 transition count 713
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 767 transition count 713
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 757 transition count 703
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 757 transition count 703
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 747 transition count 693
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 747 transition count 693
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 172 place count 737 transition count 683
Iterating global reduction 0 with 10 rules applied. Total rules applied 182 place count 737 transition count 683
Applied a total of 182 rules in 134 ms. Remains 737 /828 variables (removed 91) and now considering 683/784 (removed 101) transitions.
// Phase 1: matrix 683 rows 737 cols
[2022-05-16 16:26:54] [INFO ] Computed 67 place invariants in 4 ms
[2022-05-16 16:26:54] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 683 rows 737 cols
[2022-05-16 16:26:54] [INFO ] Computed 67 place invariants in 3 ms
[2022-05-16 16:26:55] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 737/1024 places, 683/1035 transitions.
Finished structural reductions, in 2 iterations. Remains : 737/1024 places, 683/1035 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT 1 s6), p1:(OR (LEQ 1 s6) (LEQ 2 s296))], 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]]
Entered a terminal (fully accepting) state of product in 414 steps with 0 reset in 5 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-10 finished in 1497 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(p0 U X(F(p0)))))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 1035/1035 transitions.
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1021 transition count 1035
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 1004 transition count 1017
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 1004 transition count 1017
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 48 place count 1004 transition count 1006
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1002 transition count 994
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1002 transition count 994
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 64 place count 990 transition count 972
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 990 transition count 972
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 88 place count 978 transition count 950
Iterating global reduction 2 with 12 rules applied. Total rules applied 100 place count 978 transition count 950
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 111 place count 978 transition count 939
Applied a total of 111 rules in 107 ms. Remains 978 /1024 variables (removed 46) and now considering 939/1035 (removed 96) transitions.
// Phase 1: matrix 939 rows 978 cols
[2022-05-16 16:26:55] [INFO ] Computed 82 place invariants in 12 ms
[2022-05-16 16:26:55] [INFO ] Implicit Places using invariants in 241 ms returned [176, 464, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 735]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 242 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 964/1024 places, 939/1035 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 944 transition count 919
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 944 transition count 919
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 935 transition count 901
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 935 transition count 901
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 926 transition count 892
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 926 transition count 892
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 917 transition count 883
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 917 transition count 883
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 908 transition count 874
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 908 transition count 874
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 121 place count 899 transition count 865
Iterating global reduction 0 with 9 rules applied. Total rules applied 130 place count 899 transition count 865
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 139 place count 890 transition count 856
Iterating global reduction 0 with 9 rules applied. Total rules applied 148 place count 890 transition count 856
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 157 place count 881 transition count 847
Iterating global reduction 0 with 9 rules applied. Total rules applied 166 place count 881 transition count 847
Applied a total of 166 rules in 164 ms. Remains 881 /964 variables (removed 83) and now considering 847/939 (removed 92) transitions.
// Phase 1: matrix 847 rows 881 cols
[2022-05-16 16:26:55] [INFO ] Computed 68 place invariants in 9 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 847 rows 881 cols
[2022-05-16 16:26:56] [INFO ] Computed 68 place invariants in 4 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 881/1024 places, 847/1035 transitions.
Finished structural reductions, in 2 iterations. Remains : 881/1024 places, 847/1035 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s537 s550)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-11 finished in 1416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 1035/1035 transitions.
Graph (complete) has 1349 edges and 1024 vertex of which 976 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.5 ms
Discarding 48 places :
Also discarding 47 output transitions
Drop transitions removed 47 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 581 transitions
Trivial Post-agglo rules discarded 581 transitions
Performed 581 trivial Post agglomeration. Transition count delta: 581
Iterating post reduction 0 with 582 rules applied. Total rules applied 583 place count 964 transition count 396
Reduce places removed 581 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 614 rules applied. Total rules applied 1197 place count 383 transition count 363
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1219 place count 361 transition count 363
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 163 Pre rules applied. Total rules applied 1219 place count 361 transition count 200
Deduced a syphon composed of 163 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 381 rules applied. Total rules applied 1600 place count 143 transition count 200
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 3 with 20 rules applied. Total rules applied 1620 place count 143 transition count 180
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 1650 place count 123 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1650 place count 123 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1670 place count 113 transition count 160
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1682 place count 101 transition count 128
Iterating global reduction 5 with 12 rules applied. Total rules applied 1694 place count 101 transition count 128
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 16 rules applied. Total rules applied 1710 place count 100 transition count 113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1713 place count 97 transition count 113
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1714 place count 96 transition count 102
Iterating global reduction 7 with 1 rules applied. Total rules applied 1715 place count 96 transition count 102
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 1765 place count 71 transition count 77
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 1776 place count 60 transition count 66
Applied a total of 1776 rules in 41 ms. Remains 60 /1024 variables (removed 964) and now considering 66/1035 (removed 969) transitions.
// Phase 1: matrix 66 rows 60 cols
[2022-05-16 16:26:56] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants in 50 ms returned [15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 42, 44, 56]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 51 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/1024 places, 66/1035 transitions.
Graph (complete) has 89 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 43 transition count 63
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 12 place count 34 transition count 54
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 34 transition count 54
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 29 place count 26 transition count 38
Iterating global reduction 2 with 8 rules applied. Total rules applied 37 place count 26 transition count 38
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 44 place count 19 transition count 24
Iterating global reduction 2 with 7 rules applied. Total rules applied 51 place count 19 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 18 transition count 23
Applied a total of 53 rules in 3 ms. Remains 18 /46 variables (removed 28) and now considering 23/66 (removed 43) transitions.
// Phase 1: matrix 23 rows 18 cols
[2022-05-16 16:26:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 23 rows 18 cols
[2022-05-16 16:26:56] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 16:26:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/1024 places, 23/1035 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/1024 places, 23/1035 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 s1) (LEQ s17 s10))], 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 3597 reset in 104 ms.
Product exploration explored 100000 steps with 3600 reset in 125 ms.
Computed a total of 18 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 23
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-12 finished in 571 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F((F(p1)&&p0))))'
Found a CL insensitive property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 33 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1024/1024 places, 1035/1035 transitions.
Graph (complete) has 1349 edges and 1024 vertex of which 1016 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 507 rules applied. Total rules applied 508 place count 1004 transition count 512
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 539 rules applied. Total rules applied 1047 place count 498 transition count 479
Reduce places removed 22 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 44 rules applied. Total rules applied 1091 place count 476 transition count 457
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1113 place count 454 transition count 457
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 165 Pre rules applied. Total rules applied 1113 place count 454 transition count 292
Deduced a syphon composed of 165 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 4 with 385 rules applied. Total rules applied 1498 place count 234 transition count 292
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 20 rules applied. Total rules applied 1518 place count 234 transition count 272
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 1548 place count 214 transition count 262
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 1548 place count 214 transition count 252
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1568 place count 204 transition count 252
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1584 place count 188 transition count 225
Iterating global reduction 6 with 16 rules applied. Total rules applied 1600 place count 188 transition count 225
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 16 rules applied. Total rules applied 1616 place count 187 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1619 place count 184 transition count 210
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 12 Pre rules applied. Total rules applied 1619 place count 184 transition count 198
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 1643 place count 172 transition count 198
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1645 place count 170 transition count 176
Iterating global reduction 8 with 2 rules applied. Total rules applied 1647 place count 170 transition count 176
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 8 with 22 rules applied. Total rules applied 1669 place count 170 transition count 154
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1680 place count 159 transition count 154
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1681 place count 158 transition count 143
Iterating global reduction 10 with 1 rules applied. Total rules applied 1682 place count 158 transition count 143
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1704 place count 147 transition count 132
Applied a total of 1704 rules in 57 ms. Remains 147 /1024 variables (removed 877) and now considering 132/1035 (removed 903) transitions.
// Phase 1: matrix 132 rows 147 cols
[2022-05-16 16:26:57] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 16:26:57] [INFO ] Implicit Places using invariants in 67 ms returned [11, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 101, 135]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 74 ms to find 14 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 133/1024 places, 132/1035 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 133 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 122 transition count 121
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 22 place count 122 transition count 99
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 77 place count 89 transition count 99
Applied a total of 77 rules in 3 ms. Remains 89 /133 variables (removed 44) and now considering 99/132 (removed 33) transitions.
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 16:26:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 16:26:57] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 16:26:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 16:26:57] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 89/1024 places, 99/1035 transitions.
Finished structural reductions, in 2 iterations. Remains : 89/1024 places, 99/1035 transitions.
Running random walk in product with property : FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65)), p1:(GT 1 (ADD s67 s68 s69 s70 s71 s72 s73 s74 s7...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14371 reset in 195 ms.
Product exploration explored 100000 steps with 14404 reset in 216 ms.
Computed a total of 89 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 89 transition count 99
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 354 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 8 factoid took 373 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 16:26:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:26:59] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 16:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:26:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 16:26:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:26:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 16:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:26:59] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-16 16:26:59] [INFO ] Computed and/alt/rep : 77/88/77 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 16:26:59] [INFO ] Added : 16 causal constraints over 4 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 22 out of 89 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 : 89/89 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 16:26:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 16:26:59] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 16:26:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 16:26:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-16 16:26:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 16:26:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 16:26:59] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 99/99 transitions.
Computed a total of 89 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 89 transition count 99
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 99 rows 89 cols
[2022-05-16 16:27:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 16:27:00] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:27:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:27:00] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-05-16 16:27:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:27:00] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 16:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:27:00] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-16 16:27:00] [INFO ] Computed and/alt/rep : 77/88/77 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:27:00] [INFO ] Added : 16 causal constraints over 4 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14442 reset in 157 ms.
Product exploration explored 100000 steps with 14347 reset in 187 ms.
Built C files in :
/tmp/ltsmin8938109711274860548
[2022-05-16 16:27:00] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2022-05-16 16:27:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:00] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2022-05-16 16:27:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:00] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2022-05-16 16:27:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 16:27:00] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8938109711274860548
Running compilation step : cd /tmp/ltsmin8938109711274860548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin8938109711274860548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8938109711274860548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12897805561594105908.hoa' '--buchi-type=spotba'
LTSmin run took 718 ms.
Treatment of property FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 finished in 4353 ms.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-LTLCardinality-04 TRUE TECHNIQUES CL_INSENSITIVE
[2022-05-16 16:27:01] [INFO ] Flatten gal took : 31 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 106809 ms.

BK_STOP 1652718422083

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00010M0001C001P001G001, 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 r078-tall-165260110700715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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