fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950100219
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Philosophers-PT-000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
371.804 25466.00 37076.00 515.90 FTFFFFTFTFFFFFFT normal

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.r297-tall-167873950100219.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 ltsminxred
Input is Philosophers-PT-000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950100219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 98K Feb 25 13:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 597K Feb 25 13:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 326K Feb 25 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 53K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 210K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 181K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 145K Feb 25 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 860K Feb 25 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 323K Feb 25 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 215K 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 Philosophers-PT-000100-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679468116235

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:55:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:55:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:55:18] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-22 06:55:18] [INFO ] Transformed 500 places.
[2023-03-22 06:55:18] [INFO ] Transformed 500 transitions.
[2023-03-22 06:55:18] [INFO ] Found NUPN structural information;
[2023-03-22 06:55:18] [INFO ] Parsed PT model containing 500 places and 500 transitions and 1600 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Philosophers-PT-000100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-22 06:55:19] [INFO ] Computed 200 place invariants in 13 ms
[2023-03-22 06:55:19] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-22 06:55:19] [INFO ] Invariant cache hit.
[2023-03-22 06:55:19] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-22 06:55:19] [INFO ] Invariant cache hit.
[2023-03-22 06:55:20] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2023-03-22 06:55:20] [INFO ] Flatten gal took : 115 ms
[2023-03-22 06:55:20] [INFO ] Flatten gal took : 41 ms
[2023-03-22 06:55:20] [INFO ] Input system was already deterministic with 500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:55:21] [INFO ] Invariant cache hit.
[2023-03-22 06:55:21] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:55:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 06:55:21] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
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(F(p0)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 22 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-22 06:55:22] [INFO ] Invariant cache hit.
[2023-03-22 06:55:22] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-22 06:55:22] [INFO ] Invariant cache hit.
[2023-03-22 06:55:23] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-22 06:55:23] [INFO ] Invariant cache hit.
[2023-03-22 06:55:23] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1184 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12676 steps with 9 reset in 172 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLCardinality-00 finished in 1659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U G(p1)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 400 transition count 400
Applied a total of 200 rules in 66 ms. Remains 400 /500 variables (removed 100) and now considering 400/500 (removed 100) transitions.
// Phase 1: matrix 400 rows 400 cols
[2023-03-22 06:55:23] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-22 06:55:24] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-22 06:55:24] [INFO ] Invariant cache hit.
[2023-03-22 06:55:24] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2023-03-22 06:55:24] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-22 06:55:24] [INFO ] Invariant cache hit.
[2023-03-22 06:55:24] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/500 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1137 ms. Remains : 400/500 places, 400/500 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41831 steps with 1 reset in 406 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLCardinality-02 finished in 1744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&(p2 U (p3||G(p2))))))))'
Support contains 400 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-22 06:55:25] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-22 06:55:25] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-22 06:55:25] [INFO ] Invariant cache hit.
[2023-03-22 06:55:26] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2023-03-22 06:55:26] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-22 06:55:26] [INFO ] Invariant cache hit.
[2023-03-22 06:55:26] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 926 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : Philosophers-PT-000100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(AND (GT 3 (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2092 reset in 3019 ms.
Stack based approach found an accepted trace after 12323 steps with 261 reset with depth 183 and stack size 182 in 395 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLCardinality-03 finished in 4535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 400 transition count 400
Applied a total of 200 rules in 30 ms. Remains 400 /500 variables (removed 100) and now considering 400/500 (removed 100) transitions.
// Phase 1: matrix 400 rows 400 cols
[2023-03-22 06:55:30] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-22 06:55:30] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-22 06:55:30] [INFO ] Invariant cache hit.
[2023-03-22 06:55:30] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-22 06:55:31] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 06:55:31] [INFO ] Invariant cache hit.
[2023-03-22 06:55:31] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/500 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1048 ms. Remains : 400/500 places, 400/500 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 95194 steps with 6 reset in 835 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLCardinality-04 finished in 2058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 400 transition count 400
Applied a total of 200 rules in 26 ms. Remains 400 /500 variables (removed 100) and now considering 400/500 (removed 100) transitions.
[2023-03-22 06:55:32] [INFO ] Invariant cache hit.
[2023-03-22 06:55:32] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-22 06:55:32] [INFO ] Invariant cache hit.
[2023-03-22 06:55:32] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-22 06:55:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 06:55:32] [INFO ] Invariant cache hit.
[2023-03-22 06:55:33] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/500 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1047 ms. Remains : 400/500 places, 400/500 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s189 s190 s191 s192 s195 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9745 steps with 1 reset in 100 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLCardinality-05 finished in 1207 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((X(G(!p0))||G(p1)||G(!p2)||(!p2&&F(p3))))))'
Support contains 400 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-22 06:55:33] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-22 06:55:33] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-22 06:55:33] [INFO ] Invariant cache hit.
[2023-03-22 06:55:33] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2023-03-22 06:55:33] [INFO ] Invariant cache hit.
[2023-03-22 06:55:34] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 943 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 680 ms :[true, (NOT p3), (AND p0 (NOT p1) p2), p0, (AND (NOT p3) p0), (AND (NOT p3) p0 p2), (AND (NOT p3) p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Running random walk in product with property : Philosophers-PT-000100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2), acceptance={} source=2 dest: 7}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=6 dest: 9}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={} source=7 dest: 12}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 9}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 10}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=11 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=11 dest: 11}], [{ cond=(NOT p1), acceptance={} source=12 dest: 0}, { cond=p1, acceptance={} source=12 dest: 12}], [{ cond=true, acceptance={} source=13 dest: 14}], [{ cond=true, acceptance={} source=14 dest: 2}]], initial=13, aps=[p3:(GT (ADD s285 s286 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s3...], 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, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 654 reset in 2797 ms.
Stack based approach found an accepted trace after 1525 steps with 11 reset with depth 128 and stack size 128 in 44 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000100-LTLCardinality-07 finished in 4506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0||F(p1)))&&(F(p2)||X(p3)))))'
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 23 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-22 06:55:37] [INFO ] Invariant cache hit.
[2023-03-22 06:55:38] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-22 06:55:38] [INFO ] Invariant cache hit.
[2023-03-22 06:55:38] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2023-03-22 06:55:38] [INFO ] Invariant cache hit.
[2023-03-22 06:55:39] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1207 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s482 0) (EQ s118 0) (EQ s346 1)), p0:(EQ s483 1), p1:(EQ s482 1), p3:(OR (EQ s346 0) (EQ s118 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8165 steps with 22 reset in 69 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLCardinality-11 finished in 1566 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))'
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-22 06:55:39] [INFO ] Invariant cache hit.
[2023-03-22 06:55:39] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-22 06:55:39] [INFO ] Invariant cache hit.
[2023-03-22 06:55:40] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2023-03-22 06:55:40] [INFO ] Invariant cache hit.
[2023-03-22 06:55:40] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1206 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-000100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s103 0)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000100-LTLCardinality-14 finished in 1327 ms.
All properties solved by simple procedures.
Total runtime 22428 ms.
ITS solved all properties within timeout

BK_STOP 1679468141701

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="Philosophers-PT-000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-PT-000100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950100219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000100.tgz
mv Philosophers-PT-000100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;