fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r461-smll-171701122800087
Last Updated
July 7, 2024

About the Execution of 2023-gold for UtilityControlRoom-COL-Z4T4N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1402.096 81098.00 188843.00 610.00 FTFTTTFFFTFFFFFF normal

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.r461-smll-171701122800087.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 gold2023
Input is UtilityControlRoom-COL-Z4T4N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r461-smll-171701122800087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 11K Apr 13 06:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 06:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 05:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 05:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 06:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 13 06:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 13 06:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 06:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 29K May 18 16:43 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 UtilityControlRoom-COL-Z4T4N10-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717174146285

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N10
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 16:49:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 16:49:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 16:49:08] [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-05-31 16:49:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 16:49:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2024-05-31 16:49:09] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 376 PT places and 750.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 16:49:09] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 7 ms.
[2024-05-31 16:49:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 13 cols
[2024-05-31 16:49:09] [INFO ] Computed 5 invariants in 4 ms
[2024-05-31 16:49:10] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 16:49:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-31 16:49:10] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 16:49:10] [INFO ] Flatten gal took : 20 ms
[2024-05-31 16:49:10] [INFO ] Flatten gal took : 4 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2024-05-31 16:49:10] [INFO ] Unfolded HLPN to a Petri net with 376 places and 750 transitions 2410 arcs in 33 ms.
[2024-05-31 16:49:10] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 326 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 18 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2024-05-31 16:49:10] [INFO ] Computed 23 invariants in 23 ms
[2024-05-31 16:49:10] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-31 16:49:10] [INFO ] Invariant cache hit.
[2024-05-31 16:49:10] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-05-31 16:49:10] [INFO ] Invariant cache hit.
[2024-05-31 16:49:11] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1142 ms. Remains : 376/376 places, 590/590 transitions.
Support contains 326 out of 376 places after structural reductions.
[2024-05-31 16:49:11] [INFO ] Flatten gal took : 84 ms
[2024-05-31 16:49:11] [INFO ] Flatten gal took : 60 ms
[2024-05-31 16:49:11] [INFO ] Input system was already deterministic with 590 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 22) seen :21
Finished Best-First random walk after 98 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 80 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 48 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2024-05-31 16:49:12] [INFO ] Computed 23 invariants in 12 ms
[2024-05-31 16:49:12] [INFO ] Implicit Places using invariants in 165 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 222 ms. Remains : 255/376 places, 470/590 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-02 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||(p2&&G(p3)))))'
Support contains 204 out of 376 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 366 transition count 580
Applied a total of 20 rules in 46 ms. Remains 366 /376 variables (removed 10) and now considering 580/590 (removed 10) transitions.
// Phase 1: matrix 580 rows 366 cols
[2024-05-31 16:49:12] [INFO ] Computed 23 invariants in 13 ms
[2024-05-31 16:49:13] [INFO ] Implicit Places using invariants in 212 ms returned [295]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 223 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 365/376 places, 580/590 transitions.
Applied a total of 0 rules in 19 ms. Remains 365 /365 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 365/376 places, 580/590 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s335 s336 s337 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3793 reset in 1446 ms.
Product exploration explored 100000 steps with 3795 reset in 1395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3)), (X (NOT (AND (NOT p1) p2 p3))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (AND (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 580 rows 365 cols
[2024-05-31 16:49:16] [INFO ] Computed 22 invariants in 7 ms
[2024-05-31 16:49:16] [INFO ] [Real]Absence check using 22 positive place invariants in 27 ms returned sat
[2024-05-31 16:49:16] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3)), (X (NOT (AND (NOT p1) p2 p3))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (AND (NOT p1) (NOT p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (G (NOT (AND (NOT p1) p2 p3)))]
False Knowledge obtained : [(F (AND (NOT p1) p3)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 10 factoid took 273 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
[2024-05-31 16:49:17] [INFO ] Invariant cache hit.
[2024-05-31 16:49:17] [INFO ] [Real]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-05-31 16:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:18] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2024-05-31 16:49:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:49:18] [INFO ] [Nat]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-05-31 16:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:18] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2024-05-31 16:49:18] [INFO ] Computed and/alt/rep : 540/1000/540 causal constraints (skipped 0 transitions) in 44 ms.
[2024-05-31 16:49:23] [INFO ] Added : 535 causal constraints over 107 iterations in 4863 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 40 out of 365 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 580/580 transitions.
Applied a total of 0 rules in 16 ms. Remains 365 /365 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2024-05-31 16:49:23] [INFO ] Invariant cache hit.
[2024-05-31 16:49:23] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-31 16:49:23] [INFO ] Invariant cache hit.
[2024-05-31 16:49:24] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-05-31 16:49:24] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-31 16:49:24] [INFO ] Invariant cache hit.
[2024-05-31 16:49:24] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1194 ms. Remains : 365/365 places, 580/580 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
[2024-05-31 16:49:25] [INFO ] Invariant cache hit.
[2024-05-31 16:49:25] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-05-31 16:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:25] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2024-05-31 16:49:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 16:49:26] [INFO ] [Nat]Absence check using 22 positive place invariants in 18 ms returned sat
[2024-05-31 16:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 16:49:26] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-05-31 16:49:26] [INFO ] Computed and/alt/rep : 540/1000/540 causal constraints (skipped 0 transitions) in 46 ms.
[2024-05-31 16:49:31] [INFO ] Added : 535 causal constraints over 107 iterations in 4449 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3801 reset in 399 ms.
Product exploration explored 100000 steps with 3783 reset in 411 ms.
Built C files in :
/tmp/ltsmin17792284137949418214
[2024-05-31 16:49:32] [INFO ] Computing symmetric may disable matrix : 580 transitions.
[2024-05-31 16:49:32] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:49:32] [INFO ] Computing symmetric may enable matrix : 580 transitions.
[2024-05-31 16:49:32] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:49:32] [INFO ] Computing Do-Not-Accords matrix : 580 transitions.
[2024-05-31 16:49:32] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:49:32] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17792284137949418214
Running compilation step : cd /tmp/ltsmin17792284137949418214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2277 ms.
Running link step : cd /tmp/ltsmin17792284137949418214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin17792284137949418214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8669002744383621066.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 40 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 580/580 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 365 transition count 420
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 205 transition count 380
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 205 transition count 340
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 165 transition count 340
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 162 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 162 transition count 220
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 467 place count 151 transition count 210
Applied a total of 467 rules in 47 ms. Remains 151 /365 variables (removed 214) and now considering 210/580 (removed 370) transitions.
// Phase 1: matrix 210 rows 151 cols
[2024-05-31 16:49:47] [INFO ] Computed 21 invariants in 2 ms
[2024-05-31 16:49:47] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 16:49:47] [INFO ] Invariant cache hit.
[2024-05-31 16:49:47] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-31 16:49:47] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 16:49:47] [INFO ] Invariant cache hit.
[2024-05-31 16:49:47] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/365 places, 210/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 151/365 places, 210/580 transitions.
Built C files in :
/tmp/ltsmin8670414637407451106
[2024-05-31 16:49:47] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2024-05-31 16:49:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:49:47] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2024-05-31 16:49:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:49:47] [INFO ] Computing Do-Not-Accords matrix : 210 transitions.
[2024-05-31 16:49:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 16:49:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8670414637407451106
Running compilation step : cd /tmp/ltsmin8670414637407451106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 598 ms.
Running link step : cd /tmp/ltsmin8670414637407451106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8670414637407451106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1232307536453249421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 16:50:03] [INFO ] Flatten gal took : 30 ms
[2024-05-31 16:50:03] [INFO ] Flatten gal took : 17 ms
[2024-05-31 16:50:03] [INFO ] Time to serialize gal into /tmp/LTL16588433480118345993.gal : 4 ms
[2024-05-31 16:50:03] [INFO ] Time to serialize properties into /tmp/LTL10970954893935813614.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16588433480118345993.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4100255514207218127.hoa' '-atoms' '/tmp/LTL10970954893935813614.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10970954893935813614.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4100255514207218127.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
218 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.2355,72996,1,0,123,366530,20,25,3815,205310,251
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-03 finished in 52706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 16 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2024-05-31 16:50:05] [INFO ] Computed 23 invariants in 3 ms
[2024-05-31 16:50:05] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-31 16:50:05] [INFO ] Invariant cache hit.
[2024-05-31 16:50:06] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-31 16:50:06] [INFO ] Invariant cache hit.
[2024-05-31 16:50:06] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1039 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s185)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-04 finished in 1738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(F(p1)))))'
Support contains 171 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 376 transition count 550
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 336 transition count 550
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 120 place count 316 transition count 530
Applied a total of 120 rules in 30 ms. Remains 316 /376 variables (removed 60) and now considering 530/590 (removed 60) transitions.
// Phase 1: matrix 530 rows 316 cols
[2024-05-31 16:50:07] [INFO ] Computed 23 invariants in 5 ms
[2024-05-31 16:50:07] [INFO ] Implicit Places using invariants in 396 ms returned [254]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 398 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/376 places, 530/590 transitions.
Applied a total of 0 rules in 10 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 ms. Remains : 315/376 places, 530/590 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s265 s266 s267 s268 s269 s270 s271 s272 s273 s274)), p1:(LEQ s254 (ADD s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 522 ms.
Stack based approach found an accepted trace after 703 steps with 0 reset with depth 704 and stack size 704 in 5 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-06 finished in 1063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 173 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 173 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 143 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 143 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 113 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 113 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 83 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 83 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 83 transition count 80
Applied a total of 656 rules in 38 ms. Remains 83 /376 variables (removed 293) and now considering 80/590 (removed 510) transitions.
// Phase 1: matrix 80 rows 83 cols
[2024-05-31 16:50:08] [INFO ] Computed 23 invariants in 0 ms
[2024-05-31 16:50:08] [INFO ] Implicit Places using invariants in 75 ms returned [0, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/376 places, 80/590 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 81 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 71 transition count 70
Applied a total of 20 rules in 4 ms. Remains 71 /81 variables (removed 10) and now considering 70/80 (removed 10) transitions.
// Phase 1: matrix 70 rows 71 cols
[2024-05-31 16:50:08] [INFO ] Computed 21 invariants in 2 ms
[2024-05-31 16:50:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 16:50:08] [INFO ] Invariant cache hit.
[2024-05-31 16:50:08] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/376 places, 70/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 245 ms. Remains : 71/376 places, 70/590 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s40 (ADD s30 s31 s32 s33 s34 s35 s36 s37 s38 s39))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11745 reset in 234 ms.
Stack based approach found an accepted trace after 32048 steps with 3796 reset with depth 7 and stack size 7 in 95 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-07 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 240 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 366 transition count 580
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 41 place count 355 transition count 570
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 121 place count 315 transition count 530
Applied a total of 121 rules in 31 ms. Remains 315 /376 variables (removed 61) and now considering 530/590 (removed 60) transitions.
// Phase 1: matrix 530 rows 315 cols
[2024-05-31 16:50:09] [INFO ] Computed 22 invariants in 7 ms
[2024-05-31 16:50:09] [INFO ] Implicit Places using invariants in 216 ms returned [294]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 219 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 314/376 places, 530/590 transitions.
Applied a total of 0 rules in 8 ms. Remains 314 /314 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 314/376 places, 530/590 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2438 reset in 853 ms.
Stack based approach found an accepted trace after 22268 steps with 551 reset with depth 69 and stack size 69 in 194 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-08 finished in 1410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 54 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 9 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2024-05-31 16:50:10] [INFO ] Computed 23 invariants in 4 ms
[2024-05-31 16:50:10] [INFO ] Implicit Places using invariants in 210 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3) (ADD s195 s196 s197 s198 s199 s200 s201 s202 s203 s204)), p1:(GT (ADD s0 s1 s2 s3) (ADD s134 s135 s136 s137 s138 s139 s140 s141 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-09 finished in 960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 21 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 173 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 173 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 143 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 143 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 113 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 113 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 83 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 83 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 83 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 83 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 73 transition count 70
Applied a total of 676 rules in 45 ms. Remains 73 /376 variables (removed 303) and now considering 70/590 (removed 520) transitions.
// Phase 1: matrix 70 rows 73 cols
[2024-05-31 16:50:11] [INFO ] Computed 23 invariants in 1 ms
[2024-05-31 16:50:11] [INFO ] Implicit Places using invariants in 70 ms returned [0, 32]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/376 places, 70/590 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 71/376 places, 70/590 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s30 (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40)) (LEQ 2 (ADD s41 s42 s43 s44 s45 s46 s47 s48 s49 s50))), p1:(GT 3 (ADD s41 s42 s43 s44 s45 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 214 ms.
Stack based approach found an accepted trace after 157 steps with 0 reset with depth 158 and stack size 158 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-11 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 443 place count 173 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 446 place count 173 transition count 230
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 476 place count 143 transition count 200
Iterating global reduction 2 with 30 rules applied. Total rules applied 506 place count 143 transition count 200
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 536 place count 113 transition count 140
Iterating global reduction 2 with 30 rules applied. Total rules applied 566 place count 113 transition count 140
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 596 place count 83 transition count 110
Iterating global reduction 2 with 30 rules applied. Total rules applied 626 place count 83 transition count 110
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 656 place count 83 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 656 place count 83 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 676 place count 73 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 697 place count 62 transition count 60
Applied a total of 697 rules in 24 ms. Remains 62 /376 variables (removed 314) and now considering 60/590 (removed 530) transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-05-31 16:50:11] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 16:50:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 16:50:11] [INFO ] Invariant cache hit.
[2024-05-31 16:50:12] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-31 16:50:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:50:12] [INFO ] Invariant cache hit.
[2024-05-31 16:50:12] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/376 places, 60/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 62/376 places, 60/590 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s31)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 207 ms.
Stack based approach found an accepted trace after 93315 steps with 0 reset with depth 93316 and stack size 91999 in 254 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-12 finished in 758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U (p2||G(p1)))))'
Support contains 244 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 376 transition count 550
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 336 transition count 550
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 100 place count 326 transition count 540
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 121 place count 315 transition count 530
Applied a total of 121 rules in 19 ms. Remains 315 /376 variables (removed 61) and now considering 530/590 (removed 60) transitions.
// Phase 1: matrix 530 rows 315 cols
[2024-05-31 16:50:12] [INFO ] Computed 22 invariants in 5 ms
[2024-05-31 16:50:12] [INFO ] Implicit Places using invariants in 308 ms returned [254]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 314/376 places, 530/590 transitions.
Applied a total of 0 rules in 5 ms. Remains 314 /314 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 334 ms. Remains : 314/376 places, 530/590 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p1)), true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(AND (GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3325 reset in 466 ms.
Stack based approach found an accepted trace after 10566 steps with 350 reset with depth 32 and stack size 32 in 58 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-13 finished in 1007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(!p0)&&(p1||G((p2 U p0)))))))'
Support contains 25 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 8 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2024-05-31 16:50:13] [INFO ] Computed 23 invariants in 5 ms
[2024-05-31 16:50:13] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-31 16:50:13] [INFO ] Invariant cache hit.
[2024-05-31 16:50:14] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-05-31 16:50:14] [INFO ] Invariant cache hit.
[2024-05-31 16:50:14] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 963 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s206 s207 s208 s209 s210 s211 s212 s213 s214 s215)), p1:(LEQ (ADD s0 s1 s2 s3) (ADD s186 s187 s188 s189 s190 s191 s192 s193 s194 s195)), p2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 380 ms.
Product exploration explored 100000 steps with 5 reset in 593 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 137 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 12 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 526 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 p2), false, false, (AND p1 p0 (NOT p2)), (AND p1 p0 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 10) seen :7
Finished Best-First random walk after 5854 steps, including 1 resets, run visited all 3 properties in 15 ms. (steps per millisecond=390 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F p0), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND p1 p0 (NOT p2))), (F (AND p1 (NOT p0) p2)), (F (AND p1 p0 p2))]
Knowledge based reduction with 9 factoid took 524 ms. Reduced automaton from 12 states, 34 edges and 3 AP (stutter insensitive) to 12 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 487 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 p2), false, false, (AND p1 p0 (NOT p2)), (AND p1 p0 p2)]
Stuttering acceptance computed with spot in 486 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 p2), false, false, (AND p1 p0 (NOT p2)), (AND p1 p0 p2)]
[2024-05-31 16:50:18] [INFO ] Invariant cache hit.
[2024-05-31 16:50:18] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F p0), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) (NOT p0) p2))), (F (AND p1 p0 (NOT p2))), (F (AND p1 (NOT p0) p2)), (F (AND p1 p0 p2)), (G (NOT p1))]
Knowledge based reduction with 9 factoid took 641 ms. Reduced automaton from 12 states, 34 edges and 3 AP (stutter insensitive) to 12 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 p2), false, false, (AND p1 p0 (NOT p2)), (AND p1 p0 p2)]
Support contains 25 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 256 transition count 430
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 216 transition count 430
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 100 rules applied. Total rules applied 180 place count 166 transition count 380
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 220 place count 166 transition count 340
Applied a total of 220 rules in 17 ms. Remains 166 /256 variables (removed 90) and now considering 340/470 (removed 130) transitions.
// Phase 1: matrix 340 rows 166 cols
[2024-05-31 16:50:19] [INFO ] Computed 23 invariants in 3 ms
[2024-05-31 16:50:20] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-31 16:50:20] [INFO ] Invariant cache hit.
[2024-05-31 16:50:20] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-31 16:50:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 16:50:20] [INFO ] Invariant cache hit.
[2024-05-31 16:50:20] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/256 places, 340/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 726 ms. Remains : 166/256 places, 340/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 241 ms. Reduced automaton from 12 states, 34 edges and 3 AP (stutter insensitive) to 12 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1) p2), false, false, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), (AND p0 p1 (NOT p2)), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Finished Best-First random walk after 1211 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=403 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2))]
Knowledge based reduction with 21 factoid took 854 ms. Reduced automaton from 12 states, 34 edges and 3 AP (stutter insensitive) to 12 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1) p2), false, false, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), (AND p0 p1 (NOT p2)), (AND p0 p1 p2)]
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1) p2), false, false, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), (AND p0 p1 (NOT p2)), (AND p0 p1 p2)]
[2024-05-31 16:50:23] [INFO ] Invariant cache hit.
[2024-05-31 16:50:23] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F p0), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1 p2)), (G (NOT p1))]
Knowledge based reduction with 21 factoid took 1026 ms. Reduced automaton from 12 states, 34 edges and 3 AP (stutter insensitive) to 12 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1) p2), false, false, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), (AND p0 p1 (NOT p2)), (AND p0 p1 p2)]
Stuttering acceptance computed with spot in 466 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p0, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1) p2), false, false, (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), (AND p0 p1 (NOT p2)), (AND p0 p1 p2)]
Product exploration explored 100000 steps with 285 reset in 430 ms.
Stack based approach found an accepted trace after 9894 steps with 69 reset with depth 4921 and stack size 3629 in 50 ms.
FORMULA UtilityControlRoom-COL-Z4T4N10-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N10-LTLCardinality-15 finished in 12613 ms.
All properties solved by simple procedures.
Total runtime 77555 ms.

BK_STOP 1717174227383

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z4T4N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is UtilityControlRoom-COL-Z4T4N10, 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 r461-smll-171701122800087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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