Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 422K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R100C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679057232036

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R100C002
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 12:47:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 12:47:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 12:47:13] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-17 12:47:13] [INFO ] Transformed 400 places.
[2023-03-17 12:47:13] [INFO ] Transformed 202 transitions.
[2023-03-17 12:47:13] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R100C002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 202/202 transitions.
Applied a total of 0 rules in 38 ms. Remains 400 /400 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 400 cols
[2023-03-17 12:47:14] [INFO ] Computed 200 place invariants in 21 ms
[2023-03-17 12:47:14] [INFO ] Implicit Places using invariants in 393 ms returned [201, 203, 205, 207, 209, 211, 213, 215, 217, 221, 225, 227, 229, 233, 237, 241, 243, 245, 247, 249, 251, 253, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 277, 279, 281, 283, 287, 289, 291, 295, 297, 301, 303, 307, 309, 311, 315, 319, 321, 323, 325, 327, 329, 331, 333, 335, 337, 341, 343, 345, 349, 351, 353, 357, 359, 361, 365, 367, 369, 373, 375, 377, 379, 381, 383, 385, 387, 389, 391, 393, 395, 397]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 419 ms to find 83 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 317/400 places, 202/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 465 ms. Remains : 317/400 places, 202/202 transitions.
Support contains 69 out of 317 places after structural reductions.
[2023-03-17 12:47:14] [INFO ] Flatten gal took : 42 ms
[2023-03-17 12:47:14] [INFO ] Flatten gal took : 20 ms
[2023-03-17 12:47:14] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 202 rows 317 cols
[2023-03-17 12:47:15] [INFO ] Computed 117 place invariants in 8 ms
[2023-03-17 12:47:15] [INFO ] [Real]Absence check using 117 positive place invariants in 15 ms returned sat
[2023-03-17 12:47:16] [INFO ] After 239ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-17 12:47:16] [INFO ] After 273ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-17 12:47:16] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-17 12:47:16] [INFO ] [Nat]Absence check using 117 positive place invariants in 19 ms returned sat
[2023-03-17 12:47:16] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-17 12:47:16] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-17 12:47:16] [INFO ] After 775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 183 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=45 )
Parikh walk visited 9 properties in 30 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ResAllocation-PT-R100C002-LTLFireability-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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 6 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 12:47:17] [INFO ] Invariant cache hit.
[2023-03-17 12:47:17] [INFO ] Implicit Places using invariants in 160 ms returned [210, 213, 218, 221, 224, 248, 253, 257, 261, 266, 281, 286, 296, 301, 316]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 161 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 302/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s155 1) (GEQ s279 1) (GEQ s280 1)), p0:(AND (GEQ s117 1) (GEQ s259 1) (GEQ s260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 26875 steps with 55 reset in 180 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-01 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(((G(p1)||F(p2))&&p0))&&G(F(p3)))))'
Support contains 10 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 12:47:17] [INFO ] Invariant cache hit.
[2023-03-17 12:47:18] [INFO ] Implicit Places using invariants in 159 ms returned [210, 213, 218, 221, 224, 248, 253, 257, 261, 269, 281, 286, 291, 301]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 161 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 303/317 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 303 /303 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 303/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s134 1) (GEQ s137 1)), p3:(AND (GEQ s113 1) (GEQ s257 1) (GEQ s258 1)), p1:(AND (GEQ s199 1) (GEQ s302 1)), p2:(AND (GEQ s163 1) (GEQ s283 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2912 steps with 1 reset in 21 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-04 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p0) U (!p1&&X(X(G(p1)))))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 12:47:18] [INFO ] Invariant cache hit.
[2023-03-17 12:47:18] [INFO ] Implicit Places using invariants in 154 ms returned [210, 213, 221, 224, 248, 253, 257, 261, 266, 269, 281, 286, 291, 296, 301, 316]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 155 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 301/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s31 1) (GEQ s216 1) (GEQ s217 1)), p1:(AND (GEQ s46 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2550 steps with 0 reset in 11 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-05 finished in 423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(F(p1)||G(p2)||X(p3))))'
Support contains 12 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 12:47:18] [INFO ] Invariant cache hit.
[2023-03-17 12:47:19] [INFO ] Implicit Places using invariants in 156 ms returned [213, 218, 224, 248, 257, 266, 269, 281, 286, 291, 296, 301, 316]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 156 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 304/317 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 304 /304 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 304/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p1 p0) (AND p0 p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(OR (AND p1 p0) (AND p0 p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND p1 p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(OR (LT s93 1) (LT s249 1) (LT s250 1)), p1:(AND (GEQ s105 1) (GEQ s256 1) (GEQ s257 1)), p3:(AND (GEQ s35 1) (GEQ s219 1) (GEQ s220 1)), p2:(OR (LT s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 586 steps with 0 reset in 9 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-07 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 12:47:19] [INFO ] Invariant cache hit.
[2023-03-17 12:47:19] [INFO ] Implicit Places using invariants in 161 ms returned [210, 213, 218, 221, 224, 248, 253, 261, 266, 269, 281, 286, 291, 296, 301, 316]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 163 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 301/317 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 301 /301 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 301/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s154 1) (GEQ s157 1)) (AND (GEQ s99 1) (GEQ s250 1) (GEQ s251 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-09 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(!p0)) U p1))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 315 transition count 200
Applied a total of 4 rules in 27 ms. Remains 315 /317 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 315 cols
[2023-03-17 12:47:19] [INFO ] Computed 117 place invariants in 4 ms
[2023-03-17 12:47:19] [INFO ] Implicit Places using invariants in 162 ms returned [208, 211, 216, 219, 222, 246, 251, 255, 259, 264, 267, 284, 289, 294, 299, 314]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 168 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/317 places, 200/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 299/317 places, 200/202 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s82 1) (GEQ s85 1)), p0:(AND (GEQ s139 1) (GEQ s268 1) (GEQ s269 1))], nbAcceptance=2, 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 38 reset in 452 ms.
Product exploration explored 100000 steps with 38 reset in 479 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) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 433 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 692 steps, including 0 resets, run visited all 5 properties in 21 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 541 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
// Phase 1: matrix 200 rows 299 cols
[2023-03-17 12:47:22] [INFO ] Computed 101 place invariants in 4 ms
[2023-03-17 12:47:22] [INFO ] [Real]Absence check using 101 positive place invariants in 24 ms returned sat
[2023-03-17 12:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:23] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2023-03-17 12:47:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:47:23] [INFO ] [Nat]Absence check using 101 positive place invariants in 21 ms returned sat
[2023-03-17 12:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:24] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2023-03-17 12:47:24] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-17 12:47:25] [INFO ] Added : 196 causal constraints over 40 iterations in 1135 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 11 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 12:47:25] [INFO ] Invariant cache hit.
[2023-03-17 12:47:25] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-17 12:47:25] [INFO ] Invariant cache hit.
[2023-03-17 12:47:25] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-17 12:47:25] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-17 12:47:25] [INFO ] Invariant cache hit.
[2023-03-17 12:47:25] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 562 ms. Remains : 299/299 places, 200/200 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)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 577 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 797 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 596 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
[2023-03-17 12:47:27] [INFO ] Invariant cache hit.
[2023-03-17 12:47:27] [INFO ] [Real]Absence check using 101 positive place invariants in 22 ms returned sat
[2023-03-17 12:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:28] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2023-03-17 12:47:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:47:28] [INFO ] [Nat]Absence check using 101 positive place invariants in 22 ms returned sat
[2023-03-17 12:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:29] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2023-03-17 12:47:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-17 12:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-17 12:47:29] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-17 12:47:30] [INFO ] Added : 193 causal constraints over 39 iterations in 953 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 38 reset in 422 ms.
Product exploration explored 100000 steps with 38 reset in 449 ms.
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 200/200 transitions.
Applied a total of 0 rules in 8 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 12:47:31] [INFO ] Invariant cache hit.
[2023-03-17 12:47:31] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-17 12:47:31] [INFO ] Invariant cache hit.
[2023-03-17 12:47:31] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-17 12:47:31] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-17 12:47:31] [INFO ] Invariant cache hit.
[2023-03-17 12:47:31] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 299/299 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-10 finished in 11934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 315 transition count 200
Applied a total of 4 rules in 14 ms. Remains 315 /317 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 315 cols
[2023-03-17 12:47:31] [INFO ] Computed 117 place invariants in 1 ms
[2023-03-17 12:47:31] [INFO ] Implicit Places using invariants in 156 ms returned [208, 216, 219, 222, 246, 251, 255, 259, 264, 267, 279, 284, 289, 294, 299, 314]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 158 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 299/317 places, 200/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 299 /299 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 299/317 places, 200/202 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s210 1) (GEQ s211 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2575 steps with 0 reset in 13 ms.
FORMULA ResAllocation-PT-R100C002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R100C002-LTLFireability-11 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G((!p0||G(!p1)))||(!p2&&(!p0||G(!p1)))))))'
Support contains 8 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 317 cols
[2023-03-17 12:47:31] [INFO ] Computed 117 place invariants in 6 ms
[2023-03-17 12:47:32] [INFO ] Implicit Places using invariants in 159 ms returned [210, 213, 218, 221, 224, 253, 257, 261, 266, 269, 281, 286, 291, 296, 316]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 160 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 302/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND p0 p1), (AND p0 p1), p1]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s171 1) (GEQ s287 1) (GEQ s288 1)), p1:(AND (GEQ s126 1) (GEQ s129 1)), p2:(AND (GEQ s85 1) (GEQ s243 1) (GEQ s244 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Product exploration explored 100000 steps with 50000 reset in 342 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) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 9 factoid took 256 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R100C002-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R100C002-LTLFireability-12 finished in 1282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(((p0 U !(p1 U !p2))||p1))))))'
Support contains 6 out of 317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 12:47:33] [INFO ] Invariant cache hit.
[2023-03-17 12:47:33] [INFO ] Implicit Places using invariants in 148 ms returned [210, 213, 218, 221, 224, 248, 253, 257, 266, 269, 281, 291, 296, 301, 316]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 149 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 302/317 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 302/317 places, 202/202 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s105 1) (GEQ s253 1) (GEQ s254 1)), p2:(AND (GEQ s147 1) (GEQ s275 1) (GEQ s276 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 484 reset in 331 ms.
Product exploration explored 100000 steps with 482 reset in 366 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) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 133 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 202 rows 302 cols
[2023-03-17 12:47:34] [INFO ] Computed 102 place invariants in 5 ms
[2023-03-17 12:47:34] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-17 12:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:35] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2023-03-17 12:47:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:47:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2023-03-17 12:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:36] [INFO ] [Nat]Absence check using state equation in 1103 ms returned sat
[2023-03-17 12:47:36] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-17 12:47:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
[2023-03-17 12:47:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-17 12:47:36] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-17 12:47:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 229 ms
[2023-03-17 12:47:36] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-17 12:47:37] [INFO ] Added : 192 causal constraints over 39 iterations in 890 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 302 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 12:47:37] [INFO ] Invariant cache hit.
[2023-03-17 12:47:38] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-17 12:47:38] [INFO ] Invariant cache hit.
[2023-03-17 12:47:38] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-17 12:47:38] [INFO ] Invariant cache hit.
[2023-03-17 12:47:38] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 302/302 places, 202/202 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 p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 221 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=110 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-17 12:47:39] [INFO ] Invariant cache hit.
[2023-03-17 12:47:39] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-17 12:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:39] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-17 12:47:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:47:39] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-17 12:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:41] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2023-03-17 12:47:41] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-17 12:47:41] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2023-03-17 12:47:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-17 12:47:41] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-17 12:47:42] [INFO ] Added : 196 causal constraints over 40 iterations in 987 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 479 reset in 345 ms.
Product exploration explored 100000 steps with 480 reset in 399 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 302 transition count 202
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 32 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-17 12:47:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 202 rows 302 cols
[2023-03-17 12:47:43] [INFO ] Computed 102 place invariants in 1 ms
[2023-03-17 12:47:43] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/302 places, 202/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 302/302 places, 202/202 transitions.
Support contains 6 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 302 /302 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 302 cols
[2023-03-17 12:47:43] [INFO ] Computed 102 place invariants in 1 ms
[2023-03-17 12:47:43] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-17 12:47:43] [INFO ] Invariant cache hit.
[2023-03-17 12:47:44] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-17 12:47:44] [INFO ] Invariant cache hit.
[2023-03-17 12:47:44] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 302/302 places, 202/202 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-13 finished in 11058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(!p0)) U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(((p0 U !(p1 U !p2))||p1))))))'
Found a Shortening insensitive property : ResAllocation-PT-R100C002-LTLFireability-13
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 317 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 317/317 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 315 transition count 200
Applied a total of 4 rules in 15 ms. Remains 315 /317 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 315 cols
[2023-03-17 12:47:44] [INFO ] Computed 117 place invariants in 3 ms
[2023-03-17 12:47:44] [INFO ] Implicit Places using invariants in 153 ms returned [208, 211, 216, 219, 222, 246, 251, 255, 264, 267, 279, 289, 294, 299, 314]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 154 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 300/317 places, 200/202 transitions.
Applied a total of 0 rules in 8 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 177 ms. Remains : 300/317 places, 200/202 transitions.
Running random walk in product with property : ResAllocation-PT-R100C002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s105 1) (GEQ s251 1) (GEQ s252 1)), p2:(AND (GEQ s147 1) (GEQ s273 1) (GEQ s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 474 reset in 325 ms.
Product exploration explored 100000 steps with 471 reset in 370 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) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 201 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 200 rows 300 cols
[2023-03-17 12:47:46] [INFO ] Computed 102 place invariants in 3 ms
[2023-03-17 12:47:46] [INFO ] [Real]Absence check using 102 positive place invariants in 26 ms returned sat
[2023-03-17 12:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:46] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2023-03-17 12:47:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:47:46] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2023-03-17 12:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:47] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2023-03-17 12:47:47] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 12:47:48] [INFO ] Added : 196 causal constraints over 40 iterations in 1095 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 12:47:48] [INFO ] Invariant cache hit.
[2023-03-17 12:47:49] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-17 12:47:49] [INFO ] Invariant cache hit.
[2023-03-17 12:47:49] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-17 12:47:49] [INFO ] Invariant cache hit.
[2023-03-17 12:47:49] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 300/300 places, 200/200 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 p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 227 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-17 12:47:50] [INFO ] Invariant cache hit.
[2023-03-17 12:47:50] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2023-03-17 12:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:50] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2023-03-17 12:47:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:47:51] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2023-03-17 12:47:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:47:51] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2023-03-17 12:47:51] [INFO ] Computed and/alt/rep : 198/198/198 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-17 12:47:52] [INFO ] Added : 196 causal constraints over 40 iterations in 1025 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 477 reset in 328 ms.
Product exploration explored 100000 steps with 495 reset in 367 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 12:47:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 12:47:53] [INFO ] Invariant cache hit.
[2023-03-17 12:47:53] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 300/300 places, 200/200 transitions.
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 200/200 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-17 12:47:53] [INFO ] Invariant cache hit.
[2023-03-17 12:47:54] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-17 12:47:54] [INFO ] Invariant cache hit.
[2023-03-17 12:47:54] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-17 12:47:54] [INFO ] Invariant cache hit.
[2023-03-17 12:47:54] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 300/300 places, 200/200 transitions.
Treatment of property ResAllocation-PT-R100C002-LTLFireability-13 finished in 10164 ms.
[2023-03-17 12:47:54] [INFO ] Flatten gal took : 15 ms
[2023-03-17 12:47:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 12:47:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 317 places, 202 transitions and 834 arcs took 3 ms.
Total runtime 40989 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ResAllocation-PT-R100C002
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA ResAllocation-PT-R100C002-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R100C002-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679057275469

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:427
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: RELEASE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ResAllocation-PT-R100C002-LTLFireability-13
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ResAllocation-PT-R100C002-LTLFireability-13
lola: result : false
lola: markings : 3256
lola: fired transitions : 3256
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ResAllocation-PT-R100C002-LTLFireability-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ResAllocation-PT-R100C002-LTLFireability-10
lola: result : false
lola: markings : 1954
lola: fired transitions : 1956
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ResAllocation-PT-R100C002-LTLFireability-10: LTL false LTL model checker
ResAllocation-PT-R100C002-LTLFireability-13: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="ResAllocation-PT-R100C002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ResAllocation-PT-R100C002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r327-tall-167889200000772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;