Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127900436.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-432, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 192K May 5 16:51 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-432-00
FORMULA_NAME Parking-PT-432-01
FORMULA_NAME Parking-PT-432-02
FORMULA_NAME Parking-PT-432-03
FORMULA_NAME Parking-PT-432-04
FORMULA_NAME Parking-PT-432-05
FORMULA_NAME Parking-PT-432-06
FORMULA_NAME Parking-PT-432-07
FORMULA_NAME Parking-PT-432-08
FORMULA_NAME Parking-PT-432-09
FORMULA_NAME Parking-PT-432-10
FORMULA_NAME Parking-PT-432-11
FORMULA_NAME Parking-PT-432-12
FORMULA_NAME Parking-PT-432-13
FORMULA_NAME Parking-PT-432-14
FORMULA_NAME Parking-PT-432-15

=== Now, execution of the tool begins

BK_START 1620980631128

Running Version 0
[2021-05-14 08:23:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 08:23:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:23:53] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-14 08:23:53] [INFO ] Transformed 529 places.
[2021-05-14 08:23:53] [INFO ] Transformed 785 transitions.
[2021-05-14 08:23:53] [INFO ] Found NUPN structural information;
[2021-05-14 08:23:53] [INFO ] Parsed PT model containing 529 places and 785 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:23:53] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
FORMULA Parking-PT-432-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 529 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 525 transition count 453
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 525 transition count 453
Applied a total of 8 rules in 87 ms. Remains 525 /529 variables (removed 4) and now considering 453/457 (removed 4) transitions.
// Phase 1: matrix 453 rows 525 cols
[2021-05-14 08:23:53] [INFO ] Computed 124 place invariants in 32 ms
[2021-05-14 08:23:53] [INFO ] Implicit Places using invariants in 397 ms returned [64, 72, 80, 88, 96, 104, 112, 120, 144, 146, 189, 197, 205, 213, 221, 229, 237, 245, 269, 271, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 439, 447, 455, 463, 471, 479, 487, 495, 519, 521]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 425 ms to find 40 implicit places.
// Phase 1: matrix 453 rows 485 cols
[2021-05-14 08:23:53] [INFO ] Computed 84 place invariants in 4 ms
[2021-05-14 08:23:53] [INFO ] Dead Transitions using invariants and state equation in 227 ms returned []
Starting structural reductions, iteration 1 : 485/529 places, 453/457 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 453 transition count 421
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 453 transition count 421
Applied a total of 64 rules in 42 ms. Remains 453 /485 variables (removed 32) and now considering 421/453 (removed 32) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:23:54] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-14 08:23:54] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:23:54] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-14 08:23:54] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:23:54] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 453/529 places, 421/457 transitions.
[2021-05-14 08:23:55] [INFO ] Flatten gal took : 68 ms
FORMULA Parking-PT-432-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:23:55] [INFO ] Flatten gal took : 32 ms
[2021-05-14 08:23:55] [INFO ] Input system was already deterministic with 421 transitions.
Finished random walk after 15422 steps, including 139 resets, run visited all 10 properties in 125 ms. (steps per millisecond=123 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 452 transition count 404
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 436 transition count 404
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 436 transition count 388
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 420 transition count 388
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 396 transition count 364
Applied a total of 112 rules in 59 ms. Remains 396 /453 variables (removed 57) and now considering 364/421 (removed 57) transitions.
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:23:55] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:23:55] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:23:55] [INFO ] Computed 84 place invariants in 16 ms
[2021-05-14 08:23:55] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2021-05-14 08:23:55] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:23:55] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:23:56] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 396/453 places, 364/421 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s42 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 931 reset in 589 ms.
Product exploration explored 100000 steps with 933 reset in 488 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 929 reset in 456 ms.
Product exploration explored 100000 steps with 931 reset in 480 ms.
[2021-05-14 08:23:58] [INFO ] Flatten gal took : 20 ms
[2021-05-14 08:23:58] [INFO ] Flatten gal took : 19 ms
[2021-05-14 08:23:58] [INFO ] Time to serialize gal into /tmp/LTL16621915552477646895.gal : 9 ms
[2021-05-14 08:23:58] [INFO ] Time to serialize properties into /tmp/LTL791144679977512151.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16621915552477646895.gal, -t, CGAL, -LTL, /tmp/LTL791144679977512151.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16621915552477646895.gal -t CGAL -LTL /tmp/LTL791144679977512151.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p43==1)"))))
Formula 0 simplified : !FG"(p43==1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
[2021-05-14 08:24:13] [INFO ] Flatten gal took : 20 ms
[2021-05-14 08:24:13] [INFO ] Applying decomposition
[2021-05-14 08:24:13] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6206337779791329285.txt, -o, /tmp/graph6206337779791329285.bin, -w, /tmp/graph6206337779791329285.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6206337779791329285.bin, -l, -1, -v, -w, /tmp/graph6206337779791329285.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:24:13] [INFO ] Decomposing Gal with order
[2021-05-14 08:24:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:24:13] [INFO ] Removed a total of 120 redundant transitions.
[2021-05-14 08:24:13] [INFO ] Flatten gal took : 65 ms
[2021-05-14 08:24:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 17 ms.
[2021-05-14 08:24:13] [INFO ] Time to serialize gal into /tmp/LTL2136911228760499275.gal : 8 ms
[2021-05-14 08:24:13] [INFO ] Time to serialize properties into /tmp/LTL15307377672816575724.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2136911228760499275.gal, -t, CGAL, -LTL, /tmp/LTL15307377672816575724.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2136911228760499275.gal -t CGAL -LTL /tmp/LTL15307377672816575724.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i5.u21.p43==1)"))))
Formula 0 simplified : !FG"(i5.u21.p43==1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin447650610798883310
[2021-05-14 08:24:28] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin447650610798883310
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin447650610798883310]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin447650610798883310] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin447650610798883310] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Parking-PT-432-00 finished in 34522 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 452 transition count 404
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 436 transition count 404
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 436 transition count 388
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 420 transition count 388
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 396 transition count 364
Applied a total of 112 rules in 78 ms. Remains 396 /453 variables (removed 57) and now considering 364/421 (removed 57) transitions.
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:29] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:30] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:30] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:30] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2021-05-14 08:24:30] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:30] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:30] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 396/453 places, 364/421 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s108 0) (NEQ s360 1))], 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 96 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-01 finished in 1029 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 452 transition count 404
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 436 transition count 404
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 436 transition count 388
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 420 transition count 388
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 396 transition count 364
Applied a total of 112 rules in 35 ms. Remains 396 /453 variables (removed 57) and now considering 364/421 (removed 57) transitions.
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:30] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:31] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:31] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:31] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2021-05-14 08:24:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:31] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:31] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Finished structural reductions, in 1 iterations. Remains : 396/453 places, 364/421 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Parking-PT-432-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s8 1), p0:(OR (EQ s8 1) (AND (EQ s366 0) (EQ s384 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 932 reset in 459 ms.
Product exploration explored 100000 steps with 929 reset in 483 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 928 reset in 422 ms.
Product exploration explored 100000 steps with 934 reset in 497 ms.
[2021-05-14 08:24:33] [INFO ] Flatten gal took : 16 ms
[2021-05-14 08:24:33] [INFO ] Flatten gal took : 13 ms
[2021-05-14 08:24:33] [INFO ] Time to serialize gal into /tmp/LTL9099021533977311302.gal : 2 ms
[2021-05-14 08:24:33] [INFO ] Time to serialize properties into /tmp/LTL6080988276083708490.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9099021533977311302.gal, -t, CGAL, -LTL, /tmp/LTL6080988276083708490.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9099021533977311302.gal -t CGAL -LTL /tmp/LTL6080988276083708490.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p9==1)||((p489==0)&&(p513==1)))")U("(p9==1)")))))
Formula 0 simplified : !FG("((p9==1)||((p489==0)&&(p513==1)))" U "(p9==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.50062e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
936 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,9.40196,249340,1,0,12,1.53758e+06,29,8,9483,385602,33
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Parking-PT-432-03 finished in 13321 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 5 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:24:44] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:44] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:24:44] [INFO ] Computed 84 place invariants in 3 ms
[2021-05-14 08:24:44] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:24:44] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:24:44] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:45] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 453/453 places, 421/421 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s294 0) (OR (NEQ s162 0) (NEQ s314 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Parking-PT-432-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-05 finished in 1155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 452 transition count 404
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 436 transition count 404
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 436 transition count 388
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 420 transition count 388
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 396 transition count 364
Applied a total of 112 rules in 29 ms. Remains 396 /453 variables (removed 57) and now considering 364/421 (removed 57) transitions.
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:45] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:45] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:45] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:45] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2021-05-14 08:24:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 364 rows 396 cols
[2021-05-14 08:24:45] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:45] [INFO ] Dead Transitions using invariants and state equation in 167 ms returned []
Finished structural reductions, in 1 iterations. Remains : 396/453 places, 364/421 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-432-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s362 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 0 ms.
FORMULA Parking-PT-432-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-06 finished in 664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 453 transition count 406
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 438 transition count 406
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 30 place count 438 transition count 390
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 62 place count 422 transition count 390
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 108 place count 399 transition count 367
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 399 transition count 367
Applied a total of 109 rules in 37 ms. Remains 399 /453 variables (removed 54) and now considering 367/421 (removed 54) transitions.
// Phase 1: matrix 367 rows 399 cols
[2021-05-14 08:24:46] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:46] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 367 rows 399 cols
[2021-05-14 08:24:46] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:46] [INFO ] State equation strengthened by 156 read => feed constraints.
[2021-05-14 08:24:46] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2021-05-14 08:24:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 367 rows 399 cols
[2021-05-14 08:24:46] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:46] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 399/453 places, 367/421 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Parking-PT-432-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s184 0) (EQ s335 1)), p0:(EQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14870 steps with 135 reset in 75 ms.
FORMULA Parking-PT-432-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-10 finished in 1082 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 452 transition count 405
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 437 transition count 405
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 437 transition count 390
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 422 transition count 390
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 108 place count 398 transition count 366
Applied a total of 108 rules in 26 ms. Remains 398 /453 variables (removed 55) and now considering 366/421 (removed 55) transitions.
// Phase 1: matrix 366 rows 398 cols
[2021-05-14 08:24:47] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:47] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 366 rows 398 cols
[2021-05-14 08:24:47] [INFO ] Computed 84 place invariants in 1 ms
[2021-05-14 08:24:47] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2021-05-14 08:24:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 366 rows 398 cols
[2021-05-14 08:24:47] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:47] [INFO ] Dead Transitions using invariants and state equation in 181 ms returned []
Finished structural reductions, in 1 iterations. Remains : 398/453 places, 366/421 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : Parking-PT-432-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s90 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][true, true]]
Entered a terminal (fully accepting) state of product in 9072 steps with 85 reset in 40 ms.
FORMULA Parking-PT-432-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-11 finished in 766 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 421/421 transitions.
Applied a total of 0 rules in 5 ms. Remains 453 /453 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:24:47] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:47] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:24:48] [INFO ] Computed 84 place invariants in 2 ms
[2021-05-14 08:24:48] [INFO ] State equation strengthened by 108 read => feed constraints.
[2021-05-14 08:24:48] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
// Phase 1: matrix 421 rows 453 cols
[2021-05-14 08:24:48] [INFO ] Computed 84 place invariants in 7 ms
[2021-05-14 08:24:48] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Finished structural reductions, in 1 iterations. Remains : 453/453 places, 421/421 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Parking-PT-432-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s170 0) (NEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 1 reset in 1 ms.
FORMULA Parking-PT-432-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-432-12 finished in 1095 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15472435905124058975
[2021-05-14 08:24:48] [INFO ] Computing symmetric may disable matrix : 421 transitions.
[2021-05-14 08:24:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:24:48] [INFO ] Computing symmetric may enable matrix : 421 transitions.
[2021-05-14 08:24:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:24:48] [INFO ] Applying decomposition
[2021-05-14 08:24:48] [INFO ] Flatten gal took : 17 ms
[2021-05-14 08:24:48] [INFO ] Computing Do-Not-Accords matrix : 421 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1325126381191758601.txt, -o, /tmp/graph1325126381191758601.bin, -w, /tmp/graph1325126381191758601.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1325126381191758601.bin, -l, -1, -v, -w, /tmp/graph1325126381191758601.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:24:48] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:24:48] [INFO ] Decomposing Gal with order
[2021-05-14 08:24:48] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15472435905124058975
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15472435905124058975]
[2021-05-14 08:24:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:24:49] [INFO ] Removed a total of 59 redundant transitions.
[2021-05-14 08:24:49] [INFO ] Flatten gal took : 47 ms
[2021-05-14 08:24:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-14 08:24:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality16803321046396429142.gal : 13 ms
[2021-05-14 08:24:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality9472704444355523035.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality16803321046396429142.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9472704444355523035.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality16803321046396429142.gal -t CGAL -LTL /tmp/LTLCardinality9472704444355523035.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i2.u21.p43==1)"))))
Formula 0 simplified : !FG"(i2.u21.p43==1)"
Reverse transition relation is NOT exact ! Due to transitions i4.i1.i1.u47.t336, i5.i1.i3.u83.t226, i9.i0.i6.u119.t116, i11.u154.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/417/4/421
Computing Next relation with stutter on 1.50062e+06 deadlock states
Compilation finished in 2279 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15472435905124058975]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15472435905124058975]
LTSmin run took 1374 ms.
FORMULA Parking-PT-432-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620980693740

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-432"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Parking-PT-432, 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 r140-tall-162089127900436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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