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

About the Execution of 2023-gold for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1778.239 265058.00 464522.00 1592.50 TFFFFFFFFFFFFFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716844317207

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 21:12:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 21:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:12:01] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2024-05-27 21:12:01] [INFO ] Transformed 1185 places.
[2024-05-27 21:12:01] [INFO ] Transformed 1697 transitions.
[2024-05-27 21:12:01] [INFO ] Found NUPN structural information;
[2024-05-27 21:12:01] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-864-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1177 transition count 1001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1177 transition count 1001
Applied a total of 16 rules in 240 ms. Remains 1177 /1185 variables (removed 8) and now considering 1001/1009 (removed 8) transitions.
// Phase 1: matrix 1001 rows 1177 cols
[2024-05-27 21:12:01] [INFO ] Computed 280 invariants in 58 ms
[2024-05-27 21:12:03] [INFO ] Implicit Places using invariants in 1799 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 506, 508, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 684, 700, 708, 716, 724, 732, 740, 772, 774, 825, 833, 841, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1083, 1091, 1099, 1107, 1115, 1123, 1131, 1139, 1171, 1173]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1848 ms to find 78 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1099/1185 places, 1001/1009 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 1037 transition count 939
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 1037 transition count 939
Applied a total of 124 rules in 285 ms. Remains 1037 /1099 variables (removed 62) and now considering 939/1001 (removed 62) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-05-27 21:12:03] [INFO ] Computed 202 invariants in 15 ms
[2024-05-27 21:12:04] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2024-05-27 21:12:04] [INFO ] Invariant cache hit.
[2024-05-27 21:12:05] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:12:07] [INFO ] Implicit Places using invariants and state equation in 3222 ms returned []
Implicit Place search using SMT with State Equation took 4326 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1037/1185 places, 939/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6700 ms. Remains : 1037/1185 places, 939/1009 transitions.
Support contains 30 out of 1037 places after structural reductions.
[2024-05-27 21:12:08] [INFO ] Flatten gal took : 207 ms
[2024-05-27 21:12:08] [INFO ] Flatten gal took : 102 ms
[2024-05-27 21:12:08] [INFO ] Input system was already deterministic with 939 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 763 ms. (steps per millisecond=13 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-27 21:12:09] [INFO ] Invariant cache hit.
[2024-05-27 21:12:10] [INFO ] [Real]Absence check using 202 positive place invariants in 75 ms returned sat
[2024-05-27 21:12:10] [INFO ] After 439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-27 21:12:10] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2024-05-27 21:12:11] [INFO ] After 1084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-27 21:12:11] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:12:12] [INFO ] After 755ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-27 21:12:13] [INFO ] After 1619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 566 ms.
[2024-05-27 21:12:13] [INFO ] After 3760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 180 ms.
Support contains 4 out of 1037 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1037 transition count 907
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1005 transition count 907
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1005 transition count 875
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 973 transition count 875
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 228 place count 923 transition count 825
Free-agglomeration rule applied 261 times.
Iterating global reduction 2 with 261 rules applied. Total rules applied 489 place count 923 transition count 564
Reduce places removed 261 places and 0 transitions.
Graph (complete) has 1333 edges and 662 vertex of which 263 are kept as prefixes of interest. Removing 399 places using SCC suffix rule.4 ms
Discarding 399 places :
Also discarding 322 output transitions
Drop transitions removed 322 transitions
Iterating post reduction 2 with 262 rules applied. Total rules applied 751 place count 263 transition count 242
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 781 place count 263 transition count 212
Applied a total of 781 rules in 373 ms. Remains 263 /1037 variables (removed 774) and now considering 212/939 (removed 727) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 263/1037 places, 212/939 transitions.
Finished random walk after 180 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 124 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
[2024-05-27 21:12:15] [INFO ] Invariant cache hit.
[2024-05-27 21:12:16] [INFO ] Implicit Places using invariants in 1036 ms returned [619, 729]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1041 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 105 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:12:16] [INFO ] Computed 200 invariants in 7 ms
[2024-05-27 21:12:16] [INFO ] Implicit Places using invariants in 781 ms returned []
[2024-05-27 21:12:16] [INFO ] Invariant cache hit.
[2024-05-27 21:12:17] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:12:19] [INFO ] Implicit Places using invariants and state equation in 2889 ms returned []
Implicit Place search using SMT with State Equation took 3675 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4946 ms. Remains : 1033/1037 places, 937/939 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s810 0) (EQ s429 1)), p1:(AND (EQ s872 0) (EQ s322 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Parking-PT-864-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLCardinality-03 finished in 5480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 3 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 52 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-05-27 21:12:20] [INFO ] Computed 202 invariants in 8 ms
[2024-05-27 21:12:21] [INFO ] Implicit Places using invariants in 1208 ms returned [619, 729]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1212 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 113 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:12:21] [INFO ] Computed 200 invariants in 8 ms
[2024-05-27 21:12:22] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2024-05-27 21:12:22] [INFO ] Invariant cache hit.
[2024-05-27 21:12:23] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:12:26] [INFO ] Implicit Places using invariants and state equation in 3484 ms returned []
Implicit Place search using SMT with State Equation took 4667 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6048 ms. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s266 1), p0:(OR (EQ s232 0) (EQ s355 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Parking-PT-864-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLCardinality-04 finished in 6331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(p0)))))'
Support contains 1 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 56 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-05-27 21:12:26] [INFO ] Computed 202 invariants in 9 ms
[2024-05-27 21:12:27] [INFO ] Implicit Places using invariants in 951 ms returned [619, 729]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 955 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 65 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:12:27] [INFO ] Computed 200 invariants in 8 ms
[2024-05-27 21:12:28] [INFO ] Implicit Places using invariants in 754 ms returned []
[2024-05-27 21:12:28] [INFO ] Invariant cache hit.
[2024-05-27 21:12:29] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:12:31] [INFO ] Implicit Places using invariants and state equation in 3314 ms returned []
Implicit Place search using SMT with State Equation took 4073 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5149 ms. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(EQ s567 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 236 steps with 0 reset in 12 ms.
FORMULA Parking-PT-864-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLCardinality-06 finished in 5322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 2 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 906
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 906
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 874
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 874
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 228 place count 922 transition count 824
Applied a total of 228 rules in 157 ms. Remains 922 /1037 variables (removed 115) and now considering 824/939 (removed 115) transitions.
// Phase 1: matrix 824 rows 922 cols
[2024-05-27 21:12:32] [INFO ] Computed 202 invariants in 11 ms
[2024-05-27 21:12:33] [INFO ] Implicit Places using invariants in 1096 ms returned [558, 655]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1098 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 920/1037 places, 824/939 transitions.
Applied a total of 0 rules in 41 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1299 ms. Remains : 920/1037 places, 824/939 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-864-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s805 0) (EQ s885 1)), p0:(OR (EQ s805 0) (EQ s885 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2753 steps with 10 reset in 98 ms.
FORMULA Parking-PT-864-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-864-LTLCardinality-08 finished in 1503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (F(!p0)&&(!p1||G(!p2)))))'
Support contains 6 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 54 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-05-27 21:12:33] [INFO ] Computed 202 invariants in 5 ms
[2024-05-27 21:12:34] [INFO ] Implicit Places using invariants in 1204 ms returned [619, 729]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1209 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1035/1037 places, 939/939 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1033 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1033 transition count 937
Applied a total of 4 rules in 65 ms. Remains 1033 /1035 variables (removed 2) and now considering 937/939 (removed 2) transitions.
// Phase 1: matrix 937 rows 1033 cols
[2024-05-27 21:12:34] [INFO ] Computed 200 invariants in 3 ms
[2024-05-27 21:12:35] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-05-27 21:12:35] [INFO ] Invariant cache hit.
[2024-05-27 21:12:36] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:12:38] [INFO ] Implicit Places using invariants and state equation in 2745 ms returned []
Implicit Place search using SMT with State Equation took 3762 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1033/1037 places, 937/939 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5092 ms. Remains : 1033/1037 places, 937/939 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR p0 (AND p1 p2)), (NOT p0), p2, p0, (NOT p0), true, (AND (NOT p0) p2), (AND p0 p2), p2]
Running random walk in product with property : Parking-PT-864-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 p2), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=p2, acceptance={} source=8 dest: 5}, { cond=(NOT p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s25 0) (EQ s804 1)), p2:(OR (EQ s537 0) (EQ s249 1)), p0:(OR (EQ s1000 0) (EQ s1003 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 388 reset in 1766 ms.
Product exploration explored 100000 steps with 390 reset in 1388 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND p1 p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 267 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter sensitive) to 7 states, 22 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR p0 (AND p1 p2)), (NOT p0), (OR (AND (NOT p0) p2) (AND p1 p2)), p0, true, (AND (NOT p0) p2), p2]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-27 21:12:43] [INFO ] Invariant cache hit.
[2024-05-27 21:12:43] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-27 21:12:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 70 ms returned sat
[2024-05-27 21:12:45] [INFO ] After 931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-27 21:12:45] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:12:45] [INFO ] After 452ms SMT Verify possible using 248 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-27 21:12:46] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 553 ms.
[2024-05-27 21:12:46] [INFO ] After 3125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 115 ms.
Support contains 6 out of 1033 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1033/1033 places, 937/937 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1033 transition count 905
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1001 transition count 905
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1001 transition count 873
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 969 transition count 873
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 224 place count 921 transition count 825
Free-agglomeration rule applied 261 times.
Iterating global reduction 2 with 261 rules applied. Total rules applied 485 place count 921 transition count 564
Reduce places removed 261 places and 0 transitions.
Graph (complete) has 1329 edges and 660 vertex of which 348 are kept as prefixes of interest. Removing 312 places using SCC suffix rule.1 ms
Discarding 312 places :
Also discarding 248 output transitions
Drop transitions removed 248 transitions
Iterating post reduction 2 with 262 rules applied. Total rules applied 747 place count 348 transition count 316
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 779 place count 348 transition count 284
Applied a total of 779 rules in 261 ms. Remains 348 /1033 variables (removed 685) and now considering 284/937 (removed 653) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 348/1033 places, 284/937 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Finished Best-First random walk after 8791 steps, including 2 resets, run visited all 2 properties in 23 ms. (steps per millisecond=382 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND p1 p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 p2 (NOT p0))), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (NOT (AND p1 p2 p0))), (F (OR (AND (NOT p1) p0) (AND (NOT p2) p0))), (F (AND p1 (NOT p2) p0)), (F (NOT p2)), (F (AND (NOT p2) p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p2) p0))
Knowledge based reduction with 20 factoid took 320 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLCardinality-12 finished in 14452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 906
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 906
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 874
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 874
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 226 place count 923 transition count 825
Applied a total of 226 rules in 105 ms. Remains 923 /1037 variables (removed 114) and now considering 825/939 (removed 114) transitions.
// Phase 1: matrix 825 rows 923 cols
[2024-05-27 21:12:48] [INFO ] Computed 202 invariants in 6 ms
[2024-05-27 21:12:49] [INFO ] Implicit Places using invariants in 981 ms returned [559, 656]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 983 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1037 places, 825/939 transitions.
Applied a total of 0 rules in 35 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1124 ms. Remains : 921/1037 places, 825/939 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s604 0) (EQ s555 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 392 reset in 1386 ms.
Product exploration explored 100000 steps with 395 reset in 1283 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 790 steps, including 2 resets, run visited all 1 properties in 17 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 921/921 places, 825/825 transitions.
Applied a total of 0 rules in 58 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
// Phase 1: matrix 825 rows 921 cols
[2024-05-27 21:12:52] [INFO ] Computed 200 invariants in 5 ms
[2024-05-27 21:12:53] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-27 21:12:53] [INFO ] Invariant cache hit.
[2024-05-27 21:12:55] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2524 ms to find 0 implicit places.
[2024-05-27 21:12:55] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-27 21:12:55] [INFO ] Invariant cache hit.
[2024-05-27 21:12:56] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3616 ms. Remains : 921/921 places, 825/825 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2713 steps, including 10 resets, run visited all 1 properties in 57 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 401 reset in 1496 ms.
Product exploration explored 100000 steps with 397 reset in 1265 ms.
Built C files in :
/tmp/ltsmin4592049913561910118
[2024-05-27 21:12:59] [INFO ] Computing symmetric may disable matrix : 825 transitions.
[2024-05-27 21:12:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:12:59] [INFO ] Computing symmetric may enable matrix : 825 transitions.
[2024-05-27 21:12:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:13:00] [INFO ] Computing Do-Not-Accords matrix : 825 transitions.
[2024-05-27 21:13:00] [INFO ] Computation of Completed DNA matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:13:00] [INFO ] Built C files in 215ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4592049913561910118
Running compilation step : cd /tmp/ltsmin4592049913561910118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4592049913561910118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4592049913561910118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 921/921 places, 825/825 transitions.
Applied a total of 0 rules in 43 ms. Remains 921 /921 variables (removed 0) and now considering 825/825 (removed 0) transitions.
[2024-05-27 21:13:03] [INFO ] Invariant cache hit.
[2024-05-27 21:13:04] [INFO ] Implicit Places using invariants in 932 ms returned []
[2024-05-27 21:13:04] [INFO ] Invariant cache hit.
[2024-05-27 21:13:05] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2373 ms to find 0 implicit places.
[2024-05-27 21:13:05] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-27 21:13:05] [INFO ] Invariant cache hit.
[2024-05-27 21:13:06] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3325 ms. Remains : 921/921 places, 825/825 transitions.
Built C files in :
/tmp/ltsmin12250701703564650094
[2024-05-27 21:13:06] [INFO ] Computing symmetric may disable matrix : 825 transitions.
[2024-05-27 21:13:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:13:06] [INFO ] Computing symmetric may enable matrix : 825 transitions.
[2024-05-27 21:13:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:13:06] [INFO ] Computing Do-Not-Accords matrix : 825 transitions.
[2024-05-27 21:13:06] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:13:06] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12250701703564650094
Running compilation step : cd /tmp/ltsmin12250701703564650094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12250701703564650094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12250701703564650094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-27 21:13:09] [INFO ] Flatten gal took : 47 ms
[2024-05-27 21:13:10] [INFO ] Flatten gal took : 45 ms
[2024-05-27 21:13:10] [INFO ] Time to serialize gal into /tmp/LTL10288608146265351611.gal : 16 ms
[2024-05-27 21:13:10] [INFO ] Time to serialize properties into /tmp/LTL1978425374536762099.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10288608146265351611.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4444369037212503625.hoa' '-atoms' '/tmp/LTL1978425374536762099.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1978425374536762099.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4444369037212503625.hoa
Detected timeout of ITS tools.
[2024-05-27 21:13:25] [INFO ] Flatten gal took : 41 ms
[2024-05-27 21:13:25] [INFO ] Flatten gal took : 55 ms
[2024-05-27 21:13:25] [INFO ] Time to serialize gal into /tmp/LTL9615780394182213055.gal : 9 ms
[2024-05-27 21:13:25] [INFO ] Time to serialize properties into /tmp/LTL3834193712991999047.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9615780394182213055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3834193712991999047.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p765==0)||(p692==1))"))))
Formula 0 simplified : FG!"((p765==0)||(p692==1))"
Detected timeout of ITS tools.
[2024-05-27 21:13:40] [INFO ] Flatten gal took : 30 ms
[2024-05-27 21:13:40] [INFO ] Applying decomposition
[2024-05-27 21:13:40] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5813827495784052338.txt' '-o' '/tmp/graph5813827495784052338.bin' '-w' '/tmp/graph5813827495784052338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5813827495784052338.bin' '-l' '-1' '-v' '-w' '/tmp/graph5813827495784052338.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:13:40] [INFO ] Decomposing Gal with order
[2024-05-27 21:13:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:13:40] [INFO ] Removed a total of 239 redundant transitions.
[2024-05-27 21:13:40] [INFO ] Flatten gal took : 194 ms
[2024-05-27 21:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 27 ms.
[2024-05-27 21:13:41] [INFO ] Time to serialize gal into /tmp/LTL9485702769036357368.gal : 26 ms
[2024-05-27 21:13:41] [INFO ] Time to serialize properties into /tmp/LTL6533867383715039547.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9485702769036357368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6533867383715039547.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i1.i1.i1.u243.p765==0)||(i9.u227.p692==1))"))))
Formula 0 simplified : FG!"((i1.i1.i1.i1.u243.p765==0)||(i9.u227.p692==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15401899369401367131
[2024-05-27 21:13:56] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15401899369401367131
Running compilation step : cd /tmp/ltsmin15401899369401367131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2248 ms.
Running link step : cd /tmp/ltsmin15401899369401367131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin15401899369401367131;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Parking-PT-864-LTLCardinality-13 finished in 83331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1037 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1036 transition count 906
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1004 transition count 906
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1004 transition count 874
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 972 transition count 874
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 228 place count 922 transition count 824
Applied a total of 228 rules in 103 ms. Remains 922 /1037 variables (removed 115) and now considering 824/939 (removed 115) transitions.
// Phase 1: matrix 824 rows 922 cols
[2024-05-27 21:14:11] [INFO ] Computed 202 invariants in 3 ms
[2024-05-27 21:14:12] [INFO ] Implicit Places using invariants in 854 ms returned [558, 655]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 856 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 920/1037 places, 824/939 transitions.
Applied a total of 0 rules in 55 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1015 ms. Remains : 920/1037 places, 824/939 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s314 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 398 reset in 1421 ms.
Product exploration explored 100000 steps with 398 reset in 1483 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 257 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 920/920 places, 824/824 transitions.
Applied a total of 0 rules in 52 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
// Phase 1: matrix 824 rows 920 cols
[2024-05-27 21:14:16] [INFO ] Computed 200 invariants in 4 ms
[2024-05-27 21:14:17] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2024-05-27 21:14:17] [INFO ] Invariant cache hit.
[2024-05-27 21:14:19] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2890 ms to find 0 implicit places.
[2024-05-27 21:14:19] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-27 21:14:19] [INFO ] Invariant cache hit.
[2024-05-27 21:14:20] [INFO ] Dead Transitions using invariants and state equation in 1128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4092 ms. Remains : 920/920 places, 824/824 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 : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 1080 steps, including 3 resets, run visited all 1 properties in 22 ms. (steps per millisecond=49 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 250 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 394 reset in 1513 ms.
Product exploration explored 100000 steps with 397 reset in 1322 ms.
Built C files in :
/tmp/ltsmin13007865850044701746
[2024-05-27 21:14:24] [INFO ] Computing symmetric may disable matrix : 824 transitions.
[2024-05-27 21:14:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:14:24] [INFO ] Computing symmetric may enable matrix : 824 transitions.
[2024-05-27 21:14:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:14:24] [INFO ] Computing Do-Not-Accords matrix : 824 transitions.
[2024-05-27 21:14:24] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:14:24] [INFO ] Built C files in 205ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13007865850044701746
Running compilation step : cd /tmp/ltsmin13007865850044701746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13007865850044701746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13007865850044701746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 920/920 places, 824/824 transitions.
Applied a total of 0 rules in 34 ms. Remains 920 /920 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2024-05-27 21:14:27] [INFO ] Invariant cache hit.
[2024-05-27 21:14:28] [INFO ] Implicit Places using invariants in 918 ms returned []
[2024-05-27 21:14:28] [INFO ] Invariant cache hit.
[2024-05-27 21:14:29] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
[2024-05-27 21:14:29] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-27 21:14:29] [INFO ] Invariant cache hit.
[2024-05-27 21:14:30] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3473 ms. Remains : 920/920 places, 824/824 transitions.
Built C files in :
/tmp/ltsmin683012670838103678
[2024-05-27 21:14:30] [INFO ] Computing symmetric may disable matrix : 824 transitions.
[2024-05-27 21:14:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:14:30] [INFO ] Computing symmetric may enable matrix : 824 transitions.
[2024-05-27 21:14:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:14:30] [INFO ] Computing Do-Not-Accords matrix : 824 transitions.
[2024-05-27 21:14:30] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:14:30] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin683012670838103678
Running compilation step : cd /tmp/ltsmin683012670838103678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin683012670838103678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin683012670838103678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-27 21:14:33] [INFO ] Flatten gal took : 30 ms
[2024-05-27 21:14:34] [INFO ] Flatten gal took : 29 ms
[2024-05-27 21:14:34] [INFO ] Time to serialize gal into /tmp/LTL15308656524285968238.gal : 5 ms
[2024-05-27 21:14:34] [INFO ] Time to serialize properties into /tmp/LTL17949889230617486421.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15308656524285968238.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3291024958061698756.hoa' '-atoms' '/tmp/LTL17949889230617486421.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17949889230617486421.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3291024958061698756.hoa
Detected timeout of ITS tools.
[2024-05-27 21:14:49] [INFO ] Flatten gal took : 41 ms
[2024-05-27 21:14:49] [INFO ] Flatten gal took : 44 ms
[2024-05-27 21:14:49] [INFO ] Time to serialize gal into /tmp/LTL18419430350151883570.gal : 6 ms
[2024-05-27 21:14:49] [INFO ] Time to serialize properties into /tmp/LTL14494024730747166233.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18419430350151883570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14494024730747166233.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((p113==0)||(p381==1))"))))
Formula 0 simplified : GF!"((p113==0)||(p381==1))"
Detected timeout of ITS tools.
[2024-05-27 21:15:04] [INFO ] Flatten gal took : 25 ms
[2024-05-27 21:15:04] [INFO ] Applying decomposition
[2024-05-27 21:15:04] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5050300137388482481.txt' '-o' '/tmp/graph5050300137388482481.bin' '-w' '/tmp/graph5050300137388482481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5050300137388482481.bin' '-l' '-1' '-v' '-w' '/tmp/graph5050300137388482481.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:15:04] [INFO ] Decomposing Gal with order
[2024-05-27 21:15:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:15:04] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-27 21:15:04] [INFO ] Flatten gal took : 62 ms
[2024-05-27 21:15:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 12 ms.
[2024-05-27 21:15:04] [INFO ] Time to serialize gal into /tmp/LTL1884840339108534719.gal : 11 ms
[2024-05-27 21:15:04] [INFO ] Time to serialize properties into /tmp/LTL835863257637597006.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1884840339108534719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL835863257637597006.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(G("((i3.u57.p113==0)||(i5.u133.p381==1))"))))
Formula 0 simplified : GF!"((i3.u57.p113==0)||(i5.u133.p381==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 5.35201e+12 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14991458327078340904
[2024-05-27 21:15:19] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14991458327078340904
Running compilation step : cd /tmp/ltsmin14991458327078340904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2420 ms.
Running link step : cd /tmp/ltsmin14991458327078340904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14991458327078340904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 2080 ms.
FORMULA Parking-PT-864-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Parking-PT-864-LTLCardinality-14 finished in 72883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(((p2 U p3)&&p1))))||p0)))'
Support contains 10 out of 1037 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1037/1037 places, 939/939 transitions.
Applied a total of 0 rules in 31 ms. Remains 1037 /1037 variables (removed 0) and now considering 939/939 (removed 0) transitions.
// Phase 1: matrix 939 rows 1037 cols
[2024-05-27 21:15:24] [INFO ] Computed 202 invariants in 3 ms
[2024-05-27 21:15:25] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2024-05-27 21:15:25] [INFO ] Invariant cache hit.
[2024-05-27 21:15:26] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-27 21:15:28] [INFO ] Implicit Places using invariants and state equation in 2951 ms returned []
Implicit Place search using SMT with State Equation took 4005 ms to find 0 implicit places.
[2024-05-27 21:15:28] [INFO ] Invariant cache hit.
[2024-05-27 21:15:29] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5254 ms. Remains : 1037/1037 places, 939/939 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : Parking-PT-864-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s886 0) (EQ s307 1)), p1:(AND (OR (EQ s177 0) (EQ s894 1)) (OR (EQ s897 0) (EQ s880 1))), p3:(OR (EQ s1030 0) (EQ s729 1)), p2:(OR (EQ s718 0) ...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5065 ms.
Product exploration explored 100000 steps with 50000 reset in 5029 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p3 p2), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Parking-PT-864-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Parking-PT-864-LTLCardinality-15 finished in 15731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-27 21:15:40] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15969784306540561570
[2024-05-27 21:15:40] [INFO ] Computing symmetric may disable matrix : 939 transitions.
[2024-05-27 21:15:40] [INFO ] Applying decomposition
[2024-05-27 21:15:40] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:15:40] [INFO ] Computing symmetric may enable matrix : 939 transitions.
[2024-05-27 21:15:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:15:40] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10243993762573286216.txt' '-o' '/tmp/graph10243993762573286216.bin' '-w' '/tmp/graph10243993762573286216.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10243993762573286216.bin' '-l' '-1' '-v' '-w' '/tmp/graph10243993762573286216.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:15:40] [INFO ] Decomposing Gal with order
[2024-05-27 21:15:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:15:40] [INFO ] Computing Do-Not-Accords matrix : 939 transitions.
[2024-05-27 21:15:40] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:15:40] [INFO ] Built C files in 311ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15969784306540561570
Running compilation step : cd /tmp/ltsmin15969784306540561570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-27 21:15:40] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-27 21:15:40] [INFO ] Flatten gal took : 83 ms
[2024-05-27 21:15:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-27 21:15:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality4656755942005324026.gal : 13 ms
[2024-05-27 21:15:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality8165472221387692985.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4656755942005324026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8165472221387692985.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((i9.i1.u249.p765==0)||(i7.u234.p692==1))"))))
Formula 0 simplified : FG!"((i9.i1.u249.p765==0)||(i7.u234.p692==1))"
Compilation finished in 4558 ms.
Running link step : cd /tmp/ltsmin15969784306540561570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin15969784306540561570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions i1.u95.t240, i3.u135.t206, i5.u175.t172, i6.i2.i1.u215.t138, i7.u255.t104, i8.u295.t70, i10.u...276
Computing Next relation with stutter on 5.35201e+12 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1691 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,17.084,479904,1,0,942217,11494,15051,2.83172e+06,986,52389,1112786
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-864-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 260412 ms.

BK_STOP 1716844582265

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Parking-PT-864, 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 r285-smll-171654421900062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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