Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r492-smll-171636266800387.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266800387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.4K Apr 11 20:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 20:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 20:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:42 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-COL-L00010M0001C001P001G001-LTLCardinality-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717241875969

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00010M0001C001P001G001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:37:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:37:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:37:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 11:37:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 11:37:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1368 ms
[2024-06-01 11:37:59] [INFO ] Detected 5 constant HL places corresponding to 10 PT places.
[2024-06-01 11:37:59] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 1486 PT places and 1245.0 transition bindings in 46 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 11:38:00] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 8 ms.
[2024-06-01 11:38:00] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 5 formulas.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40017 steps (56 resets) in 526 ms. (75 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40004 steps (9 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
// Phase 1: matrix 66 rows 99 cols
[2024-06-01 11:38:00] [INFO ] Computed 33 invariants in 44 ms
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 3/165 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 0/29 constraints, State Equation: 0/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-06-01 11:38:00] [INFO ] Flatten gal took : 35 ms
[2024-06-01 11:38:01] [INFO ] Flatten gal took : 13 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
[2024-06-01 11:38:01] [INFO ] Unfolded HLPN to a Petri net with 1379 places and 1069 transitions 3062 arcs in 58 ms.
[2024-06-01 11:38:01] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 19 places and 0 transitions.
Support contains 501 out of 1360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1069/1069 transitions.
Reduce places removed 17 places and 0 transitions.
Discarding 121 places :
Implicit places reduction removed 121 places
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1222 transition count 1069
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 160 place count 1200 transition count 1047
Iterating global reduction 1 with 22 rules applied. Total rules applied 182 place count 1200 transition count 1047
Applied a total of 182 rules in 196 ms. Remains 1200 /1360 variables (removed 160) and now considering 1047/1069 (removed 22) transitions.
// Phase 1: matrix 1047 rows 1200 cols
[2024-06-01 11:38:01] [INFO ] Computed 194 invariants in 91 ms
[2024-06-01 11:38:02] [INFO ] Implicit Places using invariants in 1047 ms returned [99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 530, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 1061 ms to find 45 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1155/1360 places, 1047/1069 transitions.
Applied a total of 0 rules in 33 ms. Remains 1155 /1155 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1313 ms. Remains : 1155/1360 places, 1047/1069 transitions.
Support contains 501 out of 1155 places after structural reductions.
[2024-06-01 11:38:02] [INFO ] Flatten gal took : 125 ms
[2024-06-01 11:38:02] [INFO ] Flatten gal took : 98 ms
[2024-06-01 11:38:03] [INFO ] Input system was already deterministic with 1047 transitions.
RANDOM walk for 40000 steps (60 resets) in 494 ms. (80 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40002 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
// Phase 1: matrix 1047 rows 1155 cols
[2024-06-01 11:38:03] [INFO ] Computed 149 invariants in 21 ms
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 55/2202 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, Generalized P Invariants (flows): 0/128 constraints, State Equation: 0/1155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 1155 stabilizing places and 1047 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1155 transition count 1047
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(p1)&&(G(p0)||(p0&&F(p2)))))))'
Support contains 56 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 1086 transition count 1047
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 114 place count 1041 transition count 1002
Iterating global reduction 1 with 45 rules applied. Total rules applied 159 place count 1041 transition count 1002
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 171 place count 1029 transition count 980
Iterating global reduction 1 with 12 rules applied. Total rules applied 183 place count 1029 transition count 980
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 195 place count 1017 transition count 958
Iterating global reduction 1 with 12 rules applied. Total rules applied 207 place count 1017 transition count 958
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 218 place count 1006 transition count 958
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 240 place count 984 transition count 936
Iterating global reduction 2 with 22 rules applied. Total rules applied 262 place count 984 transition count 936
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 273 place count 973 transition count 925
Iterating global reduction 2 with 11 rules applied. Total rules applied 284 place count 973 transition count 925
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 295 place count 962 transition count 914
Iterating global reduction 2 with 11 rules applied. Total rules applied 306 place count 962 transition count 914
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 317 place count 951 transition count 903
Iterating global reduction 2 with 11 rules applied. Total rules applied 328 place count 951 transition count 903
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 339 place count 940 transition count 892
Iterating global reduction 2 with 11 rules applied. Total rules applied 350 place count 940 transition count 892
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 361 place count 929 transition count 881
Iterating global reduction 2 with 11 rules applied. Total rules applied 372 place count 929 transition count 881
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 383 place count 918 transition count 870
Iterating global reduction 2 with 11 rules applied. Total rules applied 394 place count 918 transition count 870
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 405 place count 907 transition count 859
Iterating global reduction 2 with 11 rules applied. Total rules applied 416 place count 907 transition count 859
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 427 place count 896 transition count 848
Iterating global reduction 2 with 11 rules applied. Total rules applied 438 place count 896 transition count 848
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 449 place count 885 transition count 837
Iterating global reduction 2 with 11 rules applied. Total rules applied 460 place count 885 transition count 837
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 471 place count 874 transition count 826
Iterating global reduction 2 with 11 rules applied. Total rules applied 482 place count 874 transition count 826
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 493 place count 863 transition count 815
Iterating global reduction 2 with 11 rules applied. Total rules applied 504 place count 863 transition count 815
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 515 place count 852 transition count 804
Iterating global reduction 2 with 11 rules applied. Total rules applied 526 place count 852 transition count 804
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 537 place count 852 transition count 793
Applied a total of 537 rules in 1436 ms. Remains 852 /1155 variables (removed 303) and now considering 793/1047 (removed 254) transitions.
// Phase 1: matrix 793 rows 852 cols
[2024-06-01 11:38:05] [INFO ] Computed 81 invariants in 11 ms
[2024-06-01 11:38:05] [INFO ] Implicit Places using invariants in 404 ms returned [442, 719]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 407 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 850/1155 places, 793/1047 transitions.
Applied a total of 0 rules in 22 ms. Remains 850 /850 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1865 ms. Remains : 850/1155 places, 793/1047 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 693 ms.
Product exploration explored 100000 steps with 50000 reset in 642 ms.
Computed a total of 850 stabilizing places and 793 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 850 transition count 793
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 p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 274 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-00 finished in 4382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1&&X(p2)))))'
Support contains 79 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 14 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 1086 transition count 1047
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 103 place count 1052 transition count 1013
Iterating global reduction 1 with 34 rules applied. Total rules applied 137 place count 1052 transition count 1013
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 149 place count 1040 transition count 991
Iterating global reduction 1 with 12 rules applied. Total rules applied 161 place count 1040 transition count 991
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 172 place count 1029 transition count 980
Iterating global reduction 1 with 11 rules applied. Total rules applied 183 place count 1029 transition count 980
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 194 place count 1018 transition count 969
Iterating global reduction 1 with 11 rules applied. Total rules applied 205 place count 1018 transition count 969
Applied a total of 205 rules in 324 ms. Remains 1018 /1155 variables (removed 137) and now considering 969/1047 (removed 78) transitions.
// Phase 1: matrix 969 rows 1018 cols
[2024-06-01 11:38:08] [INFO ] Computed 81 invariants in 10 ms
[2024-06-01 11:38:09] [INFO ] Implicit Places using invariants in 694 ms returned [187, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 885]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 704 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1005/1155 places, 969/1047 transitions.
Applied a total of 0 rules in 66 ms. Remains 1005 /1005 variables (removed 0) and now considering 969/969 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1094 ms. Remains : 1005/1155 places, 969/1047 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 596 steps with 0 reset in 3 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-01 finished in 1265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 66 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 1097 transition count 1047
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 92 place count 1063 transition count 1013
Iterating global reduction 1 with 34 rules applied. Total rules applied 126 place count 1063 transition count 1013
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 158 place count 1031 transition count 981
Iterating global reduction 1 with 32 rules applied. Total rules applied 190 place count 1031 transition count 981
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 201 place count 1020 transition count 960
Iterating global reduction 1 with 11 rules applied. Total rules applied 212 place count 1020 transition count 960
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 223 place count 1009 transition count 960
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 233 place count 999 transition count 940
Iterating global reduction 2 with 10 rules applied. Total rules applied 243 place count 999 transition count 940
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 253 place count 989 transition count 930
Iterating global reduction 2 with 10 rules applied. Total rules applied 263 place count 989 transition count 930
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 273 place count 979 transition count 920
Iterating global reduction 2 with 10 rules applied. Total rules applied 283 place count 979 transition count 920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 293 place count 969 transition count 910
Iterating global reduction 2 with 10 rules applied. Total rules applied 303 place count 969 transition count 910
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 313 place count 959 transition count 900
Iterating global reduction 2 with 10 rules applied. Total rules applied 323 place count 959 transition count 900
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 333 place count 949 transition count 890
Iterating global reduction 2 with 10 rules applied. Total rules applied 343 place count 949 transition count 890
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 353 place count 939 transition count 880
Iterating global reduction 2 with 10 rules applied. Total rules applied 363 place count 939 transition count 880
Applied a total of 363 rules in 590 ms. Remains 939 /1155 variables (removed 216) and now considering 880/1047 (removed 167) transitions.
// Phase 1: matrix 880 rows 939 cols
[2024-06-01 11:38:09] [INFO ] Computed 92 invariants in 6 ms
[2024-06-01 11:38:10] [INFO ] Implicit Places using invariants in 320 ms returned [187, 507]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 323 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 937/1155 places, 880/1047 transitions.
Applied a total of 0 rules in 25 ms. Remains 937 /937 variables (removed 0) and now considering 880/880 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 939 ms. Remains : 937/1155 places, 880/1047 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02
Product exploration explored 100000 steps with 155 reset in 650 ms.
Product exploration explored 100000 steps with 155 reset in 430 ms.
Computed a total of 937 stabilizing places and 880 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 937 transition count 880
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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 47 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-02 finished in 2692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(!p0))))))'
Support contains 33 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 1097 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 114 place count 1041 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 170 place count 1041 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 203 place count 1008 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 236 place count 1008 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 258 place count 986 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 280 place count 986 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 291 place count 975 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 323 place count 943 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 355 place count 943 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 376 place count 922 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 397 place count 922 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 418 place count 901 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 439 place count 901 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 460 place count 880 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 481 place count 880 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 502 place count 859 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 523 place count 859 transition count 790
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 533 place count 849 transition count 780
Iterating global reduction 2 with 10 rules applied. Total rules applied 543 place count 849 transition count 780
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 553 place count 839 transition count 770
Iterating global reduction 2 with 10 rules applied. Total rules applied 563 place count 839 transition count 770
Applied a total of 563 rules in 587 ms. Remains 839 /1155 variables (removed 316) and now considering 770/1047 (removed 277) transitions.
// Phase 1: matrix 770 rows 839 cols
[2024-06-01 11:38:12] [INFO ] Computed 92 invariants in 8 ms
[2024-06-01 11:38:13] [INFO ] Implicit Places using invariants in 562 ms returned [187, 441, 706]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 565 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 836/1155 places, 770/1047 transitions.
Applied a total of 0 rules in 42 ms. Remains 836 /836 variables (removed 0) and now considering 770/770 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1195 ms. Remains : 836/1155 places, 770/1047 transitions.
Stuttering acceptance computed with spot in 152 ms :[p0, true, true]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04
Product exploration explored 100000 steps with 277 reset in 539 ms.
Product exploration explored 100000 steps with 280 reset in 286 ms.
Computed a total of 836 stabilizing places and 770 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 836 transition count 770
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 : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p0, p0, p0]
RANDOM walk for 1329 steps (0 resets) in 16 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0]
// Phase 1: matrix 770 rows 836 cols
[2024-06-01 11:38:15] [INFO ] Computed 89 invariants in 13 ms
[2024-06-01 11:38:16] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 100 ms returned sat
[2024-06-01 11:38:18] [INFO ] [Real]Absence check using state equation in 1818 ms returned sat
[2024-06-01 11:38:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:38:19] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 68 ms returned sat
[2024-06-01 11:38:21] [INFO ] [Nat]Absence check using state equation in 2207 ms returned sat
[2024-06-01 11:38:21] [INFO ] Computed and/alt/rep : 757/868/757 causal constraints (skipped 2 transitions) in 84 ms.
[2024-06-01 11:38:33] [INFO ] Added : 410 causal constraints over 82 iterations in 11716 ms. Result :unknown
Could not prove EG p0
Support contains 33 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 770/770 transitions.
Applied a total of 0 rules in 26 ms. Remains 836 /836 variables (removed 0) and now considering 770/770 (removed 0) transitions.
[2024-06-01 11:38:33] [INFO ] Invariant cache hit.
[2024-06-01 11:38:33] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-06-01 11:38:33] [INFO ] Invariant cache hit.
[2024-06-01 11:38:34] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
Running 759 sub problems to find dead transitions.
[2024-06-01 11:38:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/1606 variables, and 87 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30059 ms.
Refiners :[Generalized P Invariants (flows): 87/89 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/825 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (OVERLAPS) 11/836 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/1606 variables, and 89 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 89/89 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 60388ms
Finished structural reductions in LTL mode , in 1 iterations and 62052 ms. Remains : 836/836 places, 770/770 transitions.
Computed a total of 836 stabilizing places and 770 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 836 transition count 770
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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[p0, p0, p0]
RANDOM walk for 1431 steps (0 resets) in 15 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0]
[2024-06-01 11:39:36] [INFO ] Invariant cache hit.
[2024-06-01 11:39:37] [INFO ] [Real]Absence check using 0 positive and 89 generalized place invariants in 86 ms returned sat
[2024-06-01 11:39:39] [INFO ] [Real]Absence check using state equation in 2052 ms returned sat
[2024-06-01 11:39:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:39:40] [INFO ] [Nat]Absence check using 0 positive and 89 generalized place invariants in 66 ms returned sat
[2024-06-01 11:39:43] [INFO ] [Nat]Absence check using state equation in 2712 ms returned sat
[2024-06-01 11:39:43] [INFO ] Computed and/alt/rep : 757/868/757 causal constraints (skipped 2 transitions) in 89 ms.
Could not prove EG p0
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 279 reset in 408 ms.
Product exploration explored 100000 steps with 278 reset in 441 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0]
Support contains 33 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 770/770 transitions.
Graph (complete) has 957 edges and 836 vertex of which 649 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.9 ms
Discarding 187 places :
Also discarding 143 output transitions
Drop transitions (Output transitions of discarded places.) removed 143 transitions
Performed 231 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 231 rules applied. Total rules applied 232 place count 649 transition count 627
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 232 place count 649 transition count 660
Deduced a syphon composed of 484 places in 0 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 485 place count 649 transition count 660
Discarding 319 places :
Symmetric choice reduction at 1 with 319 rule applications. Total rules 804 place count 330 transition count 341
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 1 with 319 rules applied. Total rules applied 1123 place count 330 transition count 341
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1134 place count 330 transition count 341
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1145 place count 319 transition count 330
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1156 place count 319 transition count 330
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 176 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1167 place count 319 transition count 385
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1178 place count 308 transition count 363
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 1189 place count 308 transition count 363
Deduced a syphon composed of 165 places in 0 ms
Applied a total of 1189 rules in 298 ms. Remains 308 /836 variables (removed 528) and now considering 363/770 (removed 407) transitions.
[2024-06-01 11:39:56] [INFO ] Redundant transitions in 42 ms returned []
Running 341 sub problems to find dead transitions.
// Phase 1: matrix 363 rows 308 cols
[2024-06-01 11:39:56] [INFO ] Computed 44 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 2 (OVERLAPS) 363/660 variables, 297/341 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/660 variables, 0/341 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 11/671 variables, 11/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/671 variables, 0/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 671/671 variables, and 352 constraints, problems are : Problem set: 231 solved, 110 unsolved in 15557 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 231 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 66/198 variables, 44/44 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/44 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 363/561 variables, 198/242 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 110/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/352 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 110/671 variables, 110/462 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 0/462 constraints. Problems are: Problem set: 231 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/671 variables, 0/462 constraints. Problems are: Problem set: 231 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 671/671 variables, and 462 constraints, problems are : Problem set: 231 solved, 110 unsolved in 9513 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 110/341 constraints, Known Traps: 0/0 constraints]
After SMT, in 25191ms problems are : Problem set: 231 solved, 110 unsolved
Search for dead transitions found 231 dead transitions in 25205ms
Found 231 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 231 transitions
Dead transitions reduction (with SMT) removed 231 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 308/836 places, 132/770 transitions.
Graph (complete) has 297 edges and 308 vertex of which 143 are kept as prefixes of interest. Removing 165 places using SCC suffix rule.2 ms
Discarding 165 places :
Also discarding 0 output transitions
Ensure Unique test removed 44 places
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 99 transition count 132
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 12 place count 99 transition count 132
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 23 place count 88 transition count 121
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 34 place count 88 transition count 121
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 56 place count 88 transition count 99
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 56 rules in 13 ms. Remains 88 /308 variables (removed 220) and now considering 99/132 (removed 33) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/836 places, 99/770 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25572 ms. Remains : 88/836 places, 99/770 transitions.
Support contains 33 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 770/770 transitions.
Applied a total of 0 rules in 44 ms. Remains 836 /836 variables (removed 0) and now considering 770/770 (removed 0) transitions.
// Phase 1: matrix 770 rows 836 cols
[2024-06-01 11:40:22] [INFO ] Computed 89 invariants in 18 ms
[2024-06-01 11:40:22] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-06-01 11:40:22] [INFO ] Invariant cache hit.
[2024-06-01 11:40:23] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
Running 759 sub problems to find dead transitions.
[2024-06-01 11:40:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 3.0)
(s310 3.0)
(s311 3.0)
(s312 3.0)
(s313 3.0)
(s314 3.0)
(s315 3.0)
(s316 3.0)
(s317 3.0)
(s318 3.0)
(s319 3.0)
(s320 3.0)
(s321 3.0)
(s322 3.0)
(s323 3.0)
(s324 3.0)
(s325 3.0)
(s326 3.0)
(s327 3.0)
(s328 3.0)
(s329 3.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/1606 variables, and 87 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 87/89 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 759/759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 759 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/825 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/825 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 759 unsolved
At refinement iteration 2 (OVERLAPS) 11/836 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 759 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/1606 variables, and 89 constraints, problems are : Problem set: 0 solved, 759 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 89/89 constraints, State Equation: 0/836 constraints, PredecessorRefiner: 0/759 constraints, Known Traps: 0/0 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 759 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in LTL mode , in 1 iterations and 61537 ms. Remains : 836/836 places, 770/770 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 finished in 191901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(F(p1))||(X(F(p1))&&G(!p0)))))))'
Support contains 33 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1075 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 136 place count 1019 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 192 place count 1019 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 225 place count 986 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 258 place count 986 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 280 place count 964 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 302 place count 964 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 313 place count 953 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 345 place count 921 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 377 place count 921 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 398 place count 900 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 419 place count 900 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 440 place count 879 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 461 place count 879 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 482 place count 858 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 503 place count 858 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 524 place count 837 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 545 place count 837 transition count 790
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 566 place count 816 transition count 769
Iterating global reduction 2 with 21 rules applied. Total rules applied 587 place count 816 transition count 769
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 608 place count 795 transition count 748
Iterating global reduction 2 with 21 rules applied. Total rules applied 629 place count 795 transition count 748
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 640 place count 784 transition count 737
Iterating global reduction 2 with 11 rules applied. Total rules applied 651 place count 784 transition count 737
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 662 place count 773 transition count 726
Iterating global reduction 2 with 11 rules applied. Total rules applied 673 place count 773 transition count 726
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 684 place count 762 transition count 715
Iterating global reduction 2 with 11 rules applied. Total rules applied 695 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 706 place count 751 transition count 704
Iterating global reduction 2 with 11 rules applied. Total rules applied 717 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 728 place count 740 transition count 693
Iterating global reduction 2 with 11 rules applied. Total rules applied 739 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 750 place count 729 transition count 682
Iterating global reduction 2 with 11 rules applied. Total rules applied 761 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 772 place count 729 transition count 671
Applied a total of 772 rules in 834 ms. Remains 729 /1155 variables (removed 426) and now considering 671/1047 (removed 376) transitions.
// Phase 1: matrix 671 rows 729 cols
[2024-06-01 11:41:24] [INFO ] Computed 70 invariants in 6 ms
[2024-06-01 11:41:25] [INFO ] Implicit Places using invariants in 377 ms returned [143, 331, 596]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 379 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1155 places, 671/1047 transitions.
Applied a total of 0 rules in 30 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1244 ms. Remains : 726/1155 places, 671/1047 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05
Product exploration explored 100000 steps with 366 reset in 511 ms.
Product exploration explored 100000 steps with 347 reset in 645 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-05 finished in 2908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (p1 U p2))))'
Support contains 66 out of 1155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Graph (complete) has 1476 edges and 1155 vertex of which 1040 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.6 ms
Discarding 115 places :
Also discarding 101 output transitions
Drop transitions (Output transitions of discarded places.) removed 101 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 528 rules applied. Total rules applied 529 place count 985 transition count 451
Reduce places removed 484 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 1 with 539 rules applied. Total rules applied 1068 place count 501 transition count 396
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 1123 place count 446 transition count 396
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 1123 place count 446 transition count 264
Deduced a syphon composed of 132 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 1431 place count 270 transition count 264
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 3 with 11 rules applied. Total rules applied 1442 place count 259 transition count 264
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 1442 place count 259 transition count 253
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1464 place count 248 transition count 253
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1477 place count 235 transition count 220
Iterating global reduction 4 with 13 rules applied. Total rules applied 1490 place count 235 transition count 220
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 4 with 22 rules applied. Total rules applied 1512 place count 224 transition count 209
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 1556 place count 202 transition count 187
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 1567 place count 191 transition count 176
Applied a total of 1567 rules in 71 ms. Remains 191 /1155 variables (removed 964) and now considering 176/1047 (removed 871) transitions.
// Phase 1: matrix 176 rows 191 cols
[2024-06-01 11:41:26] [INFO ] Computed 26 invariants in 2 ms
[2024-06-01 11:41:27] [INFO ] Implicit Places using invariants in 208 ms returned [11, 90, 168]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 210 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 188/1155 places, 176/1047 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 188 transition count 154
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 166 transition count 154
Applied a total of 44 rules in 11 ms. Remains 166 /188 variables (removed 22) and now considering 154/176 (removed 22) transitions.
// Phase 1: matrix 154 rows 166 cols
[2024-06-01 11:41:27] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:41:27] [INFO ] Implicit Places using invariants in 153 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 157 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/1155 places, 154/1047 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 461 ms. Remains : 155/1155 places, 154/1047 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06
Product exploration explored 100000 steps with 1580 reset in 572 ms.
Product exploration explored 100000 steps with 1582 reset in 260 ms.
Computed a total of 155 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 155 transition count 154
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 p2 p1 p0), (X p2), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 516 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-06 finished in 2068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 11 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1075 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 136 place count 1019 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 192 place count 1019 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 225 place count 986 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 258 place count 986 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 280 place count 964 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 302 place count 964 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 313 place count 953 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 345 place count 921 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 377 place count 921 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 398 place count 900 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 419 place count 900 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 440 place count 879 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 461 place count 879 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 482 place count 858 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 503 place count 858 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 524 place count 837 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 545 place count 837 transition count 790
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 566 place count 816 transition count 769
Iterating global reduction 2 with 21 rules applied. Total rules applied 587 place count 816 transition count 769
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 608 place count 795 transition count 748
Iterating global reduction 2 with 21 rules applied. Total rules applied 629 place count 795 transition count 748
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 640 place count 784 transition count 737
Iterating global reduction 2 with 11 rules applied. Total rules applied 651 place count 784 transition count 737
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 662 place count 773 transition count 726
Iterating global reduction 2 with 11 rules applied. Total rules applied 673 place count 773 transition count 726
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 684 place count 762 transition count 715
Iterating global reduction 2 with 11 rules applied. Total rules applied 695 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 706 place count 751 transition count 704
Iterating global reduction 2 with 11 rules applied. Total rules applied 717 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 728 place count 740 transition count 693
Iterating global reduction 2 with 11 rules applied. Total rules applied 739 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 750 place count 729 transition count 682
Iterating global reduction 2 with 11 rules applied. Total rules applied 761 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 772 place count 729 transition count 671
Applied a total of 772 rules in 871 ms. Remains 729 /1155 variables (removed 426) and now considering 671/1047 (removed 376) transitions.
// Phase 1: matrix 671 rows 729 cols
[2024-06-01 11:41:29] [INFO ] Computed 70 invariants in 6 ms
[2024-06-01 11:41:30] [INFO ] Implicit Places using invariants in 338 ms returned [143, 331, 596]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 340 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1155 places, 671/1047 transitions.
Applied a total of 0 rules in 22 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1234 ms. Remains : 726/1155 places, 671/1047 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Computed a total of 726 stabilizing places and 671 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 726 transition count 671
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-08 finished in 2155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p1) U G(p2)))))'
Support contains 88 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1075 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 136 place count 1019 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 192 place count 1019 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 225 place count 986 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 258 place count 986 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 280 place count 964 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 302 place count 964 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 313 place count 953 transition count 916
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 334 place count 932 transition count 885
Iterating global reduction 2 with 21 rules applied. Total rules applied 355 place count 932 transition count 885
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 365 place count 922 transition count 875
Iterating global reduction 2 with 10 rules applied. Total rules applied 375 place count 922 transition count 875
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 385 place count 912 transition count 865
Iterating global reduction 2 with 10 rules applied. Total rules applied 395 place count 912 transition count 865
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 405 place count 902 transition count 855
Iterating global reduction 2 with 10 rules applied. Total rules applied 415 place count 902 transition count 855
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 425 place count 892 transition count 845
Iterating global reduction 2 with 10 rules applied. Total rules applied 435 place count 892 transition count 845
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 445 place count 882 transition count 835
Iterating global reduction 2 with 10 rules applied. Total rules applied 455 place count 882 transition count 835
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 465 place count 872 transition count 825
Iterating global reduction 2 with 10 rules applied. Total rules applied 475 place count 872 transition count 825
Applied a total of 475 rules in 340 ms. Remains 872 /1155 variables (removed 283) and now considering 825/1047 (removed 222) transitions.
// Phase 1: matrix 825 rows 872 cols
[2024-06-01 11:41:31] [INFO ] Computed 70 invariants in 14 ms
[2024-06-01 11:41:31] [INFO ] Implicit Places using invariants in 525 ms returned [187, 474, 739]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 527 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 869/1155 places, 825/1047 transitions.
Applied a total of 0 rules in 27 ms. Remains 869 /869 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 894 ms. Remains : 869/1155 places, 825/1047 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09
Product exploration explored 100000 steps with 1206 reset in 655 ms.
Product exploration explored 100000 steps with 1210 reset in 578 ms.
Computed a total of 869 stabilizing places and 825 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 869 transition count 825
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) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 372 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (60 resets) in 416 ms. (95 steps per ms) remains 1/6 properties
BEST_FIRST walk for 19283 steps (2 resets) in 92 ms. (207 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 784 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
// Phase 1: matrix 825 rows 869 cols
[2024-06-01 11:41:35] [INFO ] Computed 67 invariants in 9 ms
[2024-06-01 11:41:36] [INFO ] [Real]Absence check using 0 positive and 67 generalized place invariants in 65 ms returned unsat
Proved EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (G p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (G (AND (NOT p0) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p2)))
Knowledge based reduction with 17 factoid took 1055 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-09 finished in 6786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U (p2 U X(p3)))))))'
Support contains 70 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 23 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 1077 transition count 1047
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 132 place count 1023 transition count 993
Iterating global reduction 1 with 54 rules applied. Total rules applied 186 place count 1023 transition count 993
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 219 place count 990 transition count 950
Iterating global reduction 1 with 33 rules applied. Total rules applied 252 place count 990 transition count 950
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 273 place count 969 transition count 929
Iterating global reduction 1 with 21 rules applied. Total rules applied 294 place count 969 transition count 929
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 304 place count 959 transition count 909
Iterating global reduction 1 with 10 rules applied. Total rules applied 314 place count 959 transition count 909
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 324 place count 949 transition count 899
Iterating global reduction 1 with 10 rules applied. Total rules applied 334 place count 949 transition count 899
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 344 place count 939 transition count 889
Iterating global reduction 1 with 10 rules applied. Total rules applied 354 place count 939 transition count 889
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 364 place count 929 transition count 879
Iterating global reduction 1 with 10 rules applied. Total rules applied 374 place count 929 transition count 879
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 384 place count 919 transition count 869
Iterating global reduction 1 with 10 rules applied. Total rules applied 394 place count 919 transition count 869
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 404 place count 909 transition count 859
Iterating global reduction 1 with 10 rules applied. Total rules applied 414 place count 909 transition count 859
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 424 place count 899 transition count 849
Iterating global reduction 1 with 10 rules applied. Total rules applied 434 place count 899 transition count 849
Applied a total of 434 rules in 589 ms. Remains 899 /1155 variables (removed 256) and now considering 849/1047 (removed 198) transitions.
// Phase 1: matrix 849 rows 899 cols
[2024-06-01 11:41:38] [INFO ] Computed 82 invariants in 9 ms
[2024-06-01 11:41:38] [INFO ] Implicit Places using invariants in 494 ms returned [187, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 766]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 497 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 886/1155 places, 849/1047 transitions.
Applied a total of 0 rules in 47 ms. Remains 886 /886 variables (removed 0) and now considering 849/849 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1134 ms. Remains : 886/1155 places, 849/1047 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11
Stuttering criterion allowed to conclude after 644 steps with 0 reset in 23 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-11 finished in 1491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||F(p2))))'
Support contains 56 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 24 places and 0 transitions.
Discarding 44 places :
Implicit places reduction removed 44 places
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 1087 transition count 1047
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 113 place count 1042 transition count 1002
Iterating global reduction 1 with 45 rules applied. Total rules applied 158 place count 1042 transition count 1002
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 180 place count 1020 transition count 970
Iterating global reduction 1 with 22 rules applied. Total rules applied 202 place count 1020 transition count 970
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 223 place count 999 transition count 949
Iterating global reduction 1 with 21 rules applied. Total rules applied 244 place count 999 transition count 949
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 265 place count 978 transition count 918
Iterating global reduction 1 with 21 rules applied. Total rules applied 286 place count 978 transition count 918
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 296 place count 968 transition count 908
Iterating global reduction 1 with 10 rules applied. Total rules applied 306 place count 968 transition count 908
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 316 place count 958 transition count 898
Iterating global reduction 1 with 10 rules applied. Total rules applied 326 place count 958 transition count 898
Applied a total of 326 rules in 420 ms. Remains 958 /1155 variables (removed 197) and now considering 898/1047 (removed 149) transitions.
// Phase 1: matrix 898 rows 958 cols
[2024-06-01 11:41:39] [INFO ] Computed 93 invariants in 12 ms
[2024-06-01 11:41:40] [INFO ] Implicit Places using invariants in 669 ms returned [187, 825]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 672 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 956/1155 places, 898/1047 transitions.
Applied a total of 0 rules in 55 ms. Remains 956 /956 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1148 ms. Remains : 956/1155 places, 898/1047 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 537 ms.
Product exploration explored 100000 steps with 50000 reset in 403 ms.
Computed a total of 956 stabilizing places and 898 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 956 transition count 898
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 p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 58 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-12 finished in 2729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 22 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Reduce places removed 25 places and 0 transitions.
Discarding 55 places :
Implicit places reduction removed 55 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1075 transition count 1047
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 136 place count 1019 transition count 991
Iterating global reduction 1 with 56 rules applied. Total rules applied 192 place count 1019 transition count 991
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 225 place count 986 transition count 948
Iterating global reduction 1 with 33 rules applied. Total rules applied 258 place count 986 transition count 948
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 280 place count 964 transition count 916
Iterating global reduction 1 with 22 rules applied. Total rules applied 302 place count 964 transition count 916
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 313 place count 953 transition count 916
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 345 place count 921 transition count 874
Iterating global reduction 2 with 32 rules applied. Total rules applied 377 place count 921 transition count 874
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 398 place count 900 transition count 853
Iterating global reduction 2 with 21 rules applied. Total rules applied 419 place count 900 transition count 853
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 440 place count 879 transition count 832
Iterating global reduction 2 with 21 rules applied. Total rules applied 461 place count 879 transition count 832
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 482 place count 858 transition count 811
Iterating global reduction 2 with 21 rules applied. Total rules applied 503 place count 858 transition count 811
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 524 place count 837 transition count 790
Iterating global reduction 2 with 21 rules applied. Total rules applied 545 place count 837 transition count 790
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 566 place count 816 transition count 769
Iterating global reduction 2 with 21 rules applied. Total rules applied 587 place count 816 transition count 769
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 608 place count 795 transition count 748
Iterating global reduction 2 with 21 rules applied. Total rules applied 629 place count 795 transition count 748
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 640 place count 784 transition count 737
Iterating global reduction 2 with 11 rules applied. Total rules applied 651 place count 784 transition count 737
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 662 place count 773 transition count 726
Iterating global reduction 2 with 11 rules applied. Total rules applied 673 place count 773 transition count 726
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 684 place count 762 transition count 715
Iterating global reduction 2 with 11 rules applied. Total rules applied 695 place count 762 transition count 715
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 706 place count 751 transition count 704
Iterating global reduction 2 with 11 rules applied. Total rules applied 717 place count 751 transition count 704
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 728 place count 740 transition count 693
Iterating global reduction 2 with 11 rules applied. Total rules applied 739 place count 740 transition count 693
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 750 place count 729 transition count 682
Iterating global reduction 2 with 11 rules applied. Total rules applied 761 place count 729 transition count 682
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 772 place count 729 transition count 671
Applied a total of 772 rules in 532 ms. Remains 729 /1155 variables (removed 426) and now considering 671/1047 (removed 376) transitions.
// Phase 1: matrix 671 rows 729 cols
[2024-06-01 11:41:42] [INFO ] Computed 70 invariants in 5 ms
[2024-06-01 11:41:42] [INFO ] Implicit Places using invariants in 304 ms returned [143, 331, 596]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 306 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 726/1155 places, 671/1047 transitions.
Applied a total of 0 rules in 27 ms. Remains 726 /726 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 866 ms. Remains : 726/1155 places, 671/1047 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, p0, p0]
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 280 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-15 finished in 988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(!p0))))))'
Found a Shortening insensitive property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04
Stuttering acceptance computed with spot in 120 ms :[p0, true, true]
Support contains 33 out of 1155 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1155/1155 places, 1047/1047 transitions.
Graph (complete) has 1476 edges and 1155 vertex of which 807 are kept as prefixes of interest. Removing 348 places using SCC suffix rule.6 ms
Discarding 348 places :
Also discarding 277 output transitions
Drop transitions (Output transitions of discarded places.) removed 277 transitions
Reduce places removed 11 places and 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 462 rules applied. Total rules applied 463 place count 774 transition count 319
Reduce places removed 440 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 462 rules applied. Total rules applied 925 place count 334 transition count 297
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 947 place count 312 transition count 297
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 947 place count 312 transition count 198
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 44 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1189 place count 169 transition count 198
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 22 rules applied. Total rules applied 1211 place count 169 transition count 176
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1233 place count 147 transition count 176
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1246 place count 134 transition count 143
Iterating global reduction 5 with 13 rules applied. Total rules applied 1259 place count 134 transition count 143
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 33 rules applied. Total rules applied 1292 place count 123 transition count 121
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1303 place count 112 transition count 121
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 1303 place count 112 transition count 110
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1325 place count 101 transition count 110
Applied a total of 1325 rules in 45 ms. Remains 101 /1155 variables (removed 1054) and now considering 110/1047 (removed 937) transitions.
// Phase 1: matrix 110 rows 101 cols
[2024-06-01 11:41:43] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 11:41:43] [INFO ] Implicit Places using invariants in 73 ms returned [66, 78]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 99/1155 places, 110/1047 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 99 transition count 99
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 88 transition count 99
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 88 transition count 88
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 77 transition count 88
Applied a total of 44 rules in 8 ms. Remains 77 /99 variables (removed 22) and now considering 88/110 (removed 22) transitions.
// Phase 1: matrix 88 rows 77 cols
[2024-06-01 11:41:43] [INFO ] Computed 0 invariants in 4 ms
[2024-06-01 11:41:43] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 11:41:43] [INFO ] Invariant cache hit.
[2024-06-01 11:41:43] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 77/1155 places, 88/1047 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 242 ms. Remains : 77/1155 places, 88/1047 transitions.
Running random walk in product with property : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04
Product exploration explored 100000 steps with 3010 reset in 353 ms.
Product exploration explored 100000 steps with 2979 reset in 397 ms.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
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 : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0]
RANDOM walk for 134 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0]
[2024-06-01 11:41:45] [INFO ] Invariant cache hit.
[2024-06-01 11:41:45] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 11:41:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:41:45] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 11:41:45] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 11:41:45] [INFO ] Added : 22 causal constraints over 5 iterations in 78 ms. Result :sat
Could not prove EG p0
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 11:41:45] [INFO ] Invariant cache hit.
[2024-06-01 11:41:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 11:41:45] [INFO ] Invariant cache hit.
[2024-06-01 11:41:45] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 11:41:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 11/165 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1885 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 11/165 variables, 11/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1666 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3565ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3568ms
Finished structural reductions in LTL mode , in 1 iterations and 3722 ms. Remains : 77/77 places, 88/88 transitions.
Computed a total of 77 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 88
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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p0, p0, p0]
RANDOM walk for 128 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 147 ms :[p0, p0, p0]
[2024-06-01 11:41:50] [INFO ] Invariant cache hit.
[2024-06-01 11:41:50] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-01 11:41:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:41:50] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 11:41:50] [INFO ] Computed and/alt/rep : 66/77/66 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 11:41:50] [INFO ] Added : 22 causal constraints over 5 iterations in 87 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 2994 reset in 345 ms.
Product exploration explored 100000 steps with 2988 reset in 320 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[p0, p0, p0]
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 11:41:51] [INFO ] Redundant transitions in 4 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-01 11:41:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 11/165 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1824 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 11/165 variables, 11/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1688 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3520ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3521ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3532 ms. Remains : 77/77 places, 88/88 transitions.
Support contains 33 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-01 11:41:55] [INFO ] Invariant cache hit.
[2024-06-01 11:41:55] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 11:41:55] [INFO ] Invariant cache hit.
[2024-06-01 11:41:55] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-06-01 11:41:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 11/165 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/165 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1823 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 88/154 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 11/165 variables, 11/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1702 ms.
Refiners :[State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3536ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3538ms
Finished structural reductions in LTL mode , in 1 iterations and 3671 ms. Remains : 77/77 places, 88/88 transitions.
Treatment of property FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04 finished in 16005 ms.
[2024-06-01 11:41:59] [INFO ] Flatten gal took : 93 ms
[2024-06-01 11:41:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 11:41:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1155 places, 1047 transitions and 2534 arcs took 21 ms.
Total runtime 240919 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04

BK_STOP 1717242687196

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FamilyReunion-COL-L00010M0001C001P001G001-LTLCardinality-04
ltl formula formula --ltl=/tmp/1312/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1155 places, 1047 transitions and 2534 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.060 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1312/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1312/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1312/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1312/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1132 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1156, there are 1052 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~572 levels ~10000 states ~32328 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~20000 states ~45896 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~40000 states ~72456 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~80000 states ~135208 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~160000 states ~262208 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~320000 states ~529304 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~640000 states ~1046076 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~1280000 states ~2098832 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~2560000 states ~4493340 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~5120000 states ~10069272 transitions
pnml2lts-mc( 3/ 4): ~572 levels ~10240000 states ~21473160 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11056027
pnml2lts-mc( 0/ 4): unique states count: 11058199
pnml2lts-mc( 0/ 4): unique transitions count: 37451601
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 26374475
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 11058203
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2388
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11058203 states 37451649 transitions, fanout: 3.387
pnml2lts-mc( 0/ 4): Total exploration time 566.310 sec (566.310 sec minimum, 566.310 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19527, Transitions per second: 66133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 148.5MB, 14.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 33.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1077 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 148.5MB (~256.0MB paged-in)

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-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-COL-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 r492-smll-171636266800387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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