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-162089127900444.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-832, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127900444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K 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.2K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 08:06 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 251K 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-832-00
FORMULA_NAME Parking-PT-832-01
FORMULA_NAME Parking-PT-832-02
FORMULA_NAME Parking-PT-832-03
FORMULA_NAME Parking-PT-832-04
FORMULA_NAME Parking-PT-832-05
FORMULA_NAME Parking-PT-832-06
FORMULA_NAME Parking-PT-832-07
FORMULA_NAME Parking-PT-832-08
FORMULA_NAME Parking-PT-832-09
FORMULA_NAME Parking-PT-832-10
FORMULA_NAME Parking-PT-832-11
FORMULA_NAME Parking-PT-832-12
FORMULA_NAME Parking-PT-832-13
FORMULA_NAME Parking-PT-832-14
FORMULA_NAME Parking-PT-832-15

=== Now, execution of the tool begins

BK_START 1620982015183

Running Version 0
[2021-05-14 08:47:08] [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:47:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:47:08] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-14 08:47:08] [INFO ] Transformed 737 places.
[2021-05-14 08:47:08] [INFO ] Transformed 993 transitions.
[2021-05-14 08:47:08] [INFO ] Found NUPN structural information;
[2021-05-14 08:47:08] [INFO ] Parsed PT model containing 737 places and 993 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:47:08] [INFO ] Initial state test concluded for 4 properties.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
FORMULA Parking-PT-832-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 737 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 730 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 730 transition count 602
Applied a total of 14 rules in 118 ms. Remains 730 /737 variables (removed 7) and now considering 602/609 (removed 7) transitions.
// Phase 1: matrix 602 rows 730 cols
[2021-05-14 08:47:08] [INFO ] Computed 184 place invariants in 24 ms
[2021-05-14 08:47:08] [INFO ] Implicit Places using invariants in 519 ms returned [136, 144, 152, 160, 184, 186, 213, 221, 229, 237, 261, 263, 290, 298, 306, 314, 338, 340, 367, 375, 383, 391, 415, 417, 452, 468, 492, 494, 522, 530, 546, 570, 572, 599, 607, 615, 623, 647, 649, 684, 692, 700, 724, 726]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 548 ms to find 44 implicit places.
// Phase 1: matrix 602 rows 686 cols
[2021-05-14 08:47:08] [INFO ] Computed 140 place invariants in 6 ms
[2021-05-14 08:47:09] [INFO ] Dead Transitions using invariants and state equation in 321 ms returned []
Starting structural reductions, iteration 1 : 686/737 places, 602/609 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 658 transition count 574
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 658 transition count 574
Applied a total of 56 rules in 77 ms. Remains 658 /686 variables (removed 28) and now considering 574/602 (removed 28) transitions.
// Phase 1: matrix 574 rows 658 cols
[2021-05-14 08:47:09] [INFO ] Computed 140 place invariants in 3 ms
[2021-05-14 08:47:09] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 574 rows 658 cols
[2021-05-14 08:47:09] [INFO ] Computed 140 place invariants in 3 ms
[2021-05-14 08:47:09] [INFO ] State equation strengthened by 152 read => feed constraints.
[2021-05-14 08:47:10] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 658/737 places, 574/609 transitions.
[2021-05-14 08:47:10] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 08:47:10] [INFO ] Flatten gal took : 97 ms
FORMULA Parking-PT-832-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:47:11] [INFO ] Flatten gal took : 47 ms
[2021-05-14 08:47:11] [INFO ] Input system was already deterministic with 574 transitions.
Incomplete random walk after 100000 steps, including 501 resets, run finished after 826 ms. (steps per millisecond=121 ) properties (out of 13) seen :10
Running SMT prover for 3 properties.
// Phase 1: matrix 574 rows 658 cols
[2021-05-14 08:47:11] [INFO ] Computed 140 place invariants in 2 ms
[2021-05-14 08:47:12] [INFO ] [Real]Absence check using 140 positive place invariants in 25 ms returned sat
[2021-05-14 08:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:47:12] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-14 08:47:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:47:12] [INFO ] [Nat]Absence check using 140 positive place invariants in 17 ms returned unsat
[2021-05-14 08:47:12] [INFO ] [Real]Absence check using 140 positive place invariants in 24 ms returned sat
[2021-05-14 08:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:47:12] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-14 08:47:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:47:12] [INFO ] [Nat]Absence check using 140 positive place invariants in 24 ms returned sat
[2021-05-14 08:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:47:12] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-14 08:47:12] [INFO ] State equation strengthened by 152 read => feed constraints.
[2021-05-14 08:47:12] [INFO ] [Nat]Added 152 Read/Feed constraints in 16 ms returned sat
[2021-05-14 08:47:13] [INFO ] Computed and/alt/rep : 573/1459/573 causal constraints (skipped 0 transitions) in 37 ms.
[2021-05-14 08:47:23] [INFO ] Deduced a trap composed of 43 places in 7347 ms of which 4 ms to minimize.
[2021-05-14 08:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7417 ms
[2021-05-14 08:47:23] [INFO ] Added : 433 causal constraints over 87 iterations in 10663 ms. Result :sat
[2021-05-14 08:47:23] [INFO ] [Real]Absence check using 140 positive place invariants in 29 ms returned sat
[2021-05-14 08:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 08:47:24] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-14 08:47:24] [INFO ] [Real]Added 152 Read/Feed constraints in 24 ms returned sat
[2021-05-14 08:47:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 08:47:24] [INFO ] [Nat]Absence check using 140 positive place invariants in 24 ms returned sat
[2021-05-14 08:47:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 08:47:24] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-14 08:47:24] [INFO ] [Nat]Added 152 Read/Feed constraints in 16 ms returned sat
[2021-05-14 08:47:24] [INFO ] Computed and/alt/rep : 573/1459/573 causal constraints (skipped 0 transitions) in 34 ms.
[2021-05-14 08:47:27] [INFO ] Added : 483 causal constraints over 97 iterations in 3365 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA Parking-PT-832-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||G(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 658/658 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 657 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 657 transition count 573
Applied a total of 2 rules in 40 ms. Remains 657 /658 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 657 cols
[2021-05-14 08:47:27] [INFO ] Computed 140 place invariants in 2 ms
[2021-05-14 08:47:28] [INFO ] Implicit Places using invariants in 307 ms returned [404, 419, 488, 611]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 309 ms to find 4 implicit places.
// Phase 1: matrix 573 rows 653 cols
[2021-05-14 08:47:28] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:47:28] [INFO ] Dead Transitions using invariants and state equation in 266 ms returned []
Starting structural reductions, iteration 1 : 653/658 places, 573/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 649 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 649 transition count 569
Applied a total of 8 rules in 35 ms. Remains 649 /653 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 649 cols
[2021-05-14 08:47:28] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:47:28] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 569 rows 649 cols
[2021-05-14 08:47:28] [INFO ] Computed 136 place invariants in 3 ms
[2021-05-14 08:47:28] [INFO ] State equation strengthened by 152 read => feed constraints.
[2021-05-14 08:47:29] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 649/658 places, 569/574 transitions.
Stuttering acceptance computed with spot in 10753 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Parking-PT-832-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s184 1), p1:(OR (EQ s132 0) (EQ s612 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23225 reset in 1335 ms.
Product exploration explored 100000 steps with 25232 reset in 1354 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24530 reset in 1157 ms.
Product exploration explored 100000 steps with 23667 reset in 1199 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 649 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 649/649 places, 569/569 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 649 transition count 569
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 15 place count 649 transition count 569
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 649 transition count 569
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 46 place count 634 transition count 554
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 61 place count 634 transition count 554
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 92 place count 634 transition count 569
Deduced a syphon composed of 47 places in 1 ms
Applied a total of 92 rules in 122 ms. Remains 634 /649 variables (removed 15) and now considering 569/569 (removed 0) transitions.
[2021-05-14 08:47:58] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 569 rows 634 cols
[2021-05-14 08:47:58] [INFO ] Computed 136 place invariants in 5 ms
[2021-05-14 08:47:58] [INFO ] Dead Transitions using invariants and state equation in 347 ms returned []
Finished structural reductions, in 1 iterations. Remains : 634/649 places, 569/569 transitions.
Product exploration explored 100000 steps with 24228 reset in 3095 ms.
Product exploration explored 100000 steps with 24821 reset in 3092 ms.
[2021-05-14 08:48:04] [INFO ] Flatten gal took : 40 ms
[2021-05-14 08:48:04] [INFO ] Flatten gal took : 38 ms
[2021-05-14 08:48:04] [INFO ] Time to serialize gal into /tmp/LTL10635576633634834930.gal : 8 ms
[2021-05-14 08:48:04] [INFO ] Time to serialize properties into /tmp/LTL7559644077199294995.ltl : 29 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/LTL10635576633634834930.gal, -t, CGAL, -LTL, /tmp/LTL7559644077199294995.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/LTL10635576633634834930.gal -t CGAL -LTL /tmp/LTL7559644077199294995.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p195!=1)")||(G(F("((p132==0)||(p693==1))"))))))))
Formula 0 simplified : !XXF("(p195!=1)" | GF"((p132==0)||(p693==1))")
Detected timeout of ITS tools.
[2021-05-14 08:48:32] [INFO ] Flatten gal took : 32 ms
[2021-05-14 08:48:32] [INFO ] Applying decomposition
[2021-05-14 08:48:32] [INFO ] Flatten gal took : 31 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/graph15223449692068153292.txt, -o, /tmp/graph15223449692068153292.bin, -w, /tmp/graph15223449692068153292.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/graph15223449692068153292.bin, -l, -1, -v, -w, /tmp/graph15223449692068153292.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:48:32] [INFO ] Decomposing Gal with order
[2021-05-14 08:48:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:48:33] [INFO ] Removed a total of 52 redundant transitions.
[2021-05-14 08:48:33] [INFO ] Flatten gal took : 116 ms
[2021-05-14 08:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 34 ms.
[2021-05-14 08:48:33] [INFO ] Time to serialize gal into /tmp/LTL4379664220818394862.gal : 36 ms
[2021-05-14 08:48:33] [INFO ] Time to serialize properties into /tmp/LTL12254761050579424647.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/LTL4379664220818394862.gal, -t, CGAL, -LTL, /tmp/LTL12254761050579424647.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/LTL4379664220818394862.gal -t CGAL -LTL /tmp/LTL12254761050579424647.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i7.u83.p195!=1)")||(G(F("((i5.i0.i0.u64.p132==0)||(i17.u233.p693==1))"))))))))
Formula 0 simplified : !XXF("(i7.u83.p195!=1)" | GF"((i5.i0.i0.u64.p132==0)||(i17.u233.p693==1))")
Reverse transition relation is NOT exact ! Due to transitions i5.i0.i3.u80.t129, i7.u103.t111, i8.u126.t93, i11.u150.t75, i12.u174.t57, i14.u197.t38, i15.u221.t20, i17.u246.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/561/8/569
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16609090549087775652
[2021-05-14 08:48:53] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16609090549087775652
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/ltsmin16609090549087775652]
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/ltsmin16609090549087775652] 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/ltsmin16609090549087775652] 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-832-01 finished in 86219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 658/658 places, 574/574 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 658 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 642 transition count 558
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 642 transition count 542
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 626 transition count 542
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 625 transition count 541
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 625 transition count 541
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 132 place count 592 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 591 transition count 527
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 591 transition count 527
Applied a total of 135 rules in 107 ms. Remains 591 /658 variables (removed 67) and now considering 527/574 (removed 47) transitions.
// Phase 1: matrix 527 rows 591 cols
[2021-05-14 08:48:54] [INFO ] Computed 140 place invariants in 2 ms
[2021-05-14 08:48:54] [INFO ] Implicit Places using invariants in 224 ms returned [380, 441, 552]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 225 ms to find 3 implicit places.
[2021-05-14 08:48:54] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 527 rows 588 cols
[2021-05-14 08:48:54] [INFO ] Computed 137 place invariants in 3 ms
[2021-05-14 08:48:54] [INFO ] Dead Transitions using invariants and state equation in 218 ms returned []
Starting structural reductions, iteration 1 : 588/658 places, 527/574 transitions.
Applied a total of 0 rules in 29 ms. Remains 588 /588 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2021-05-14 08:48:54] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 527 rows 588 cols
[2021-05-14 08:48:54] [INFO ] Computed 137 place invariants in 1 ms
[2021-05-14 08:48:54] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 2 iterations. Remains : 588/658 places, 527/574 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s370 0) (EQ s113 1)) (OR (EQ s528 0) (EQ s426 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 506 reset in 672 ms.
Product exploration explored 100000 steps with 511 reset in 690 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 507 reset in 603 ms.
Product exploration explored 100000 steps with 519 reset in 667 ms.
[2021-05-14 08:48:57] [INFO ] Flatten gal took : 43 ms
[2021-05-14 08:48:57] [INFO ] Flatten gal took : 77 ms
[2021-05-14 08:48:57] [INFO ] Time to serialize gal into /tmp/LTL2677829217401394550.gal : 5 ms
[2021-05-14 08:48:57] [INFO ] Time to serialize properties into /tmp/LTL17471462399331893755.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/LTL2677829217401394550.gal, -t, CGAL, -LTL, /tmp/LTL17471462399331893755.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/LTL2677829217401394550.gal -t CGAL -LTL /tmp/LTL17471462399331893755.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p448==0)||(p113==1))&&((p658==0)||(p521==1)))"))))
Formula 0 simplified : !FG"(((p448==0)||(p113==1))&&((p658==0)||(p521==1)))"
Reverse transition relation is NOT exact ! Due to transitions t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/526/1/527
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2021-05-14 08:49:12] [INFO ] Flatten gal took : 29 ms
[2021-05-14 08:49:12] [INFO ] Applying decomposition
[2021-05-14 08:49:12] [INFO ] Flatten gal took : 28 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/graph14432932301284789155.txt, -o, /tmp/graph14432932301284789155.bin, -w, /tmp/graph14432932301284789155.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/graph14432932301284789155.bin, -l, -1, -v, -w, /tmp/graph14432932301284789155.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:49:12] [INFO ] Decomposing Gal with order
[2021-05-14 08:49:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:49:12] [INFO ] Removed a total of 704 redundant transitions.
[2021-05-14 08:49:13] [INFO ] Flatten gal took : 52 ms
[2021-05-14 08:49:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 78 ms.
[2021-05-14 08:49:13] [INFO ] Time to serialize gal into /tmp/LTL12737932397877638976.gal : 4 ms
[2021-05-14 08:49:13] [INFO ] Time to serialize properties into /tmp/LTL61844560981791118.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/LTL12737932397877638976.gal, -t, CGAL, -LTL, /tmp/LTL61844560981791118.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/LTL12737932397877638976.gal -t CGAL -LTL /tmp/LTL61844560981791118.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i10.u154.p448==0)||(i2.u56.p113==1))&&((i13.u212.p658==0)||(i11.u177.p521==1)))"))))
Formula 0 simplified : !FG"(((i10.u154.p448==0)||(i2.u56.p113==1))&&((i13.u212.p658==0)||(i11.u177.p521==1)))"
Reverse transition relation is NOT exact ! Due to transitions i13.u212.t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/494/1/495
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4917779818767652170
[2021-05-14 08:49:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4917779818767652170
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/ltsmin4917779818767652170]
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/ltsmin4917779818767652170] 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/ltsmin4917779818767652170] 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-832-05 finished in 35119 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 658 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 658/658 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 657 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 657 transition count 573
Applied a total of 2 rules in 18 ms. Remains 657 /658 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 657 cols
[2021-05-14 08:49:29] [INFO ] Computed 140 place invariants in 1 ms
[2021-05-14 08:49:29] [INFO ] Implicit Places using invariants in 231 ms returned [404, 419, 488, 611]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 232 ms to find 4 implicit places.
// Phase 1: matrix 573 rows 653 cols
[2021-05-14 08:49:29] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:49:29] [INFO ] Dead Transitions using invariants and state equation in 273 ms returned []
Starting structural reductions, iteration 1 : 653/658 places, 573/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 649 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 649 transition count 569
Applied a total of 8 rules in 25 ms. Remains 649 /653 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 649 cols
[2021-05-14 08:49:29] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:49:29] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 569 rows 649 cols
[2021-05-14 08:49:29] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:49:30] [INFO ] State equation strengthened by 152 read => feed constraints.
[2021-05-14 08:49:30] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 649/658 places, 569/574 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-832-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (NEQ s88 0) (NEQ s493 0) (NEQ s56 1)) (NEQ s56 0) (NEQ s493 1)), p0:(AND (NEQ s508 0) (NEQ s532 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Parking-PT-832-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-06 finished in 1854 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 658 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 658/658 places, 574/574 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 658 transition count 559
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 643 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 642 transition count 558
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 32 place count 642 transition count 543
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 62 place count 627 transition count 543
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 626 transition count 542
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 626 transition count 542
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 134 place count 591 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 590 transition count 526
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 590 transition count 526
Applied a total of 137 rules in 88 ms. Remains 590 /658 variables (removed 68) and now considering 526/574 (removed 48) transitions.
// Phase 1: matrix 526 rows 590 cols
[2021-05-14 08:49:31] [INFO ] Computed 140 place invariants in 2 ms
[2021-05-14 08:49:31] [INFO ] Implicit Places using invariants in 256 ms returned [370, 380, 441, 551]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 265 ms to find 4 implicit places.
[2021-05-14 08:49:31] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 526 rows 586 cols
[2021-05-14 08:49:31] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:49:31] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Starting structural reductions, iteration 1 : 586/658 places, 526/574 transitions.
Applied a total of 0 rules in 23 ms. Remains 586 /586 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2021-05-14 08:49:31] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 526 rows 586 cols
[2021-05-14 08:49:31] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:49:31] [INFO ] Dead Transitions using invariants and state equation in 253 ms returned []
Finished structural reductions, in 2 iterations. Remains : 586/658 places, 526/574 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s317 0) (EQ s550 1)) (AND (EQ s328 0) (EQ s351 1)) (AND (EQ s54 0) (EQ s424 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]]
Product exploration explored 100000 steps with 1330 reset in 788 ms.
Product exploration explored 100000 steps with 1353 reset in 858 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1313 reset in 775 ms.
Product exploration explored 100000 steps with 1310 reset in 888 ms.
[2021-05-14 08:49:35] [INFO ] Flatten gal took : 25 ms
[2021-05-14 08:49:35] [INFO ] Flatten gal took : 25 ms
[2021-05-14 08:49:35] [INFO ] Time to serialize gal into /tmp/LTL8772824044582667207.gal : 3 ms
[2021-05-14 08:49:35] [INFO ] Time to serialize properties into /tmp/LTL2347267793315669686.ltl : 93 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/LTL8772824044582667207.gal, -t, CGAL, -LTL, /tmp/LTL2347267793315669686.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/LTL8772824044582667207.gal -t CGAL -LTL /tmp/LTL2347267793315669686.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((((p383==0)&&(p687==1))||((p400==0)&&(p427==1)))||((p54==0)&&(p520==1)))")))
Formula 0 simplified : !F"((((p383==0)&&(p687==1))||((p400==0)&&(p427==1)))||((p54==0)&&(p520==1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2021-05-14 08:49:50] [INFO ] Flatten gal took : 24 ms
[2021-05-14 08:49:50] [INFO ] Applying decomposition
[2021-05-14 08:49:50] [INFO ] Flatten gal took : 24 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/graph14470221537194686139.txt, -o, /tmp/graph14470221537194686139.bin, -w, /tmp/graph14470221537194686139.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/graph14470221537194686139.bin, -l, -1, -v, -w, /tmp/graph14470221537194686139.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:49:50] [INFO ] Decomposing Gal with order
[2021-05-14 08:49:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:49:50] [INFO ] Removed a total of 708 redundant transitions.
[2021-05-14 08:49:50] [INFO ] Flatten gal took : 53 ms
[2021-05-14 08:49:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 39 ms.
[2021-05-14 08:49:50] [INFO ] Time to serialize gal into /tmp/LTL12424529682653283653.gal : 10 ms
[2021-05-14 08:49:50] [INFO ] Time to serialize properties into /tmp/LTL2961334852454666046.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/LTL12424529682653283653.gal, -t, CGAL, -LTL, /tmp/LTL2961334852454666046.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/LTL12424529682653283653.gal -t CGAL -LTL /tmp/LTL2961334852454666046.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((((i9.u130.p383==0)&&(i15.u224.p687==1))||((i5.i1.i0.u134.p400==0)&&(i10.u145.p427==1)))||((i5.i1.i0.u26.p54==0)&&(i11.u176.p520==1)))")))
Formula 0 simplified : !F"((((i9.u130.p383==0)&&(i15.u224.p687==1))||((i5.i1.i0.u134.p400==0)&&(i10.u145.p427==1)))||((i5.i1.i0.u26.p54==0)&&(i11.u176.p520==1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17050029384936593187
[2021-05-14 08:50:05] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17050029384936593187
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/ltsmin17050029384936593187]
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/ltsmin17050029384936593187] 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/ltsmin17050029384936593187] 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-832-09 finished in 35801 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 658 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 658/658 places, 574/574 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 657 transition count 573
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 657 transition count 573
Applied a total of 2 rules in 28 ms. Remains 657 /658 variables (removed 1) and now considering 573/574 (removed 1) transitions.
// Phase 1: matrix 573 rows 657 cols
[2021-05-14 08:50:06] [INFO ] Computed 140 place invariants in 2 ms
[2021-05-14 08:50:07] [INFO ] Implicit Places using invariants in 244 ms returned [404, 419, 488, 611]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 250 ms to find 4 implicit places.
// Phase 1: matrix 573 rows 653 cols
[2021-05-14 08:50:07] [INFO ] Computed 136 place invariants in 1 ms
[2021-05-14 08:50:07] [INFO ] Dead Transitions using invariants and state equation in 298 ms returned []
Starting structural reductions, iteration 1 : 653/658 places, 573/574 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 649 transition count 569
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 649 transition count 569
Applied a total of 8 rules in 17 ms. Remains 649 /653 variables (removed 4) and now considering 569/573 (removed 4) transitions.
// Phase 1: matrix 569 rows 649 cols
[2021-05-14 08:50:07] [INFO ] Computed 136 place invariants in 1 ms
[2021-05-14 08:50:07] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 569 rows 649 cols
[2021-05-14 08:50:07] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:50:08] [INFO ] State equation strengthened by 152 read => feed constraints.
[2021-05-14 08:50:08] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1327 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 649/658 places, 569/574 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Parking-PT-832-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s297 0), p1:(EQ s297 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]]
Product exploration explored 100000 steps with 50000 reset in 1389 ms.
Product exploration explored 100000 steps with 50000 reset in 1416 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 1354 ms.
Product exploration explored 100000 steps with 50000 reset in 1394 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 1 out of 649 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 649/649 places, 569/569 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 649 transition count 569
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 16 place count 649 transition count 569
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 649 transition count 569
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 633 transition count 553
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 633 transition count 553
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 96 place count 633 transition count 569
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 96 rules in 46 ms. Remains 633 /649 variables (removed 16) and now considering 569/569 (removed 0) transitions.
[2021-05-14 08:50:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 569 rows 633 cols
[2021-05-14 08:50:14] [INFO ] Computed 136 place invariants in 1 ms
[2021-05-14 08:50:14] [INFO ] Dead Transitions using invariants and state equation in 274 ms returned []
Finished structural reductions, in 1 iterations. Remains : 633/649 places, 569/569 transitions.
Product exploration explored 100000 steps with 50000 reset in 1367 ms.
Product exploration explored 100000 steps with 50000 reset in 1402 ms.
[2021-05-14 08:50:17] [INFO ] Flatten gal took : 18 ms
[2021-05-14 08:50:17] [INFO ] Flatten gal took : 18 ms
[2021-05-14 08:50:17] [INFO ] Time to serialize gal into /tmp/LTL6862463776998924749.gal : 2 ms
[2021-05-14 08:50:17] [INFO ] Time to serialize properties into /tmp/LTL12761578990483265664.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/LTL6862463776998924749.gal, -t, CGAL, -LTL, /tmp/LTL12761578990483265664.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/LTL6862463776998924749.gal -t CGAL -LTL /tmp/LTL12761578990483265664.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p327==0)")||(X(F("(p327==1)"))))))
Formula 0 simplified : !X("(p327==0)" | XF"(p327==1)")
Detected timeout of ITS tools.
[2021-05-14 08:50:32] [INFO ] Flatten gal took : 19 ms
[2021-05-14 08:50:32] [INFO ] Applying decomposition
[2021-05-14 08:50:32] [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/graph208711286330167656.txt, -o, /tmp/graph208711286330167656.bin, -w, /tmp/graph208711286330167656.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/graph208711286330167656.bin, -l, -1, -v, -w, /tmp/graph208711286330167656.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:50:32] [INFO ] Decomposing Gal with order
[2021-05-14 08:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:50:32] [INFO ] Removed a total of 51 redundant transitions.
[2021-05-14 08:50:32] [INFO ] Flatten gal took : 32 ms
[2021-05-14 08:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-14 08:50:32] [INFO ] Time to serialize gal into /tmp/LTL15199535308418546932.gal : 4 ms
[2021-05-14 08:50:34] [INFO ] Time to serialize properties into /tmp/LTL10959505708835394768.ltl : 1908 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/LTL15199535308418546932.gal, -t, CGAL, -LTL, /tmp/LTL10959505708835394768.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/LTL15199535308418546932.gal -t CGAL -LTL /tmp/LTL10959505708835394768.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i7.u121.p327==0)")||(X(F("(i7.u121.p327==1)"))))))
Formula 0 simplified : !X("(i7.u121.p327==0)" | XF"(i7.u121.p327==1)")
Reverse transition relation is NOT exact ! Due to transitions i2.u80.t129, i6.u103.t111, i7.u126.t93, i8.u150.t75, i9.u172.t57, i11.i1.i5.u196.t38, i13.u219.t20, i14.i0.i1.u242.t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/561/8/569
Computing Next relation with stutter on 7.8311e+10 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
442 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,4.48014,173236,1,0,347626,2231,8077,786600,501,7386,355030
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-832-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Parking-PT-832-12 finished in 33294 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 658/658 places, 574/574 transitions.
Applied a total of 0 rules in 8 ms. Remains 658 /658 variables (removed 0) and now considering 574/574 (removed 0) transitions.
// Phase 1: matrix 574 rows 658 cols
[2021-05-14 08:50:40] [INFO ] Computed 140 place invariants in 2 ms
[2021-05-14 08:50:40] [INFO ] Implicit Places using invariants in 235 ms returned [404, 419]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 236 ms to find 2 implicit places.
// Phase 1: matrix 574 rows 656 cols
[2021-05-14 08:50:40] [INFO ] Computed 138 place invariants in 2 ms
[2021-05-14 08:50:40] [INFO ] Dead Transitions using invariants and state equation in 267 ms returned []
Starting structural reductions, iteration 1 : 656/658 places, 574/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 654 transition count 572
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 654 transition count 572
Applied a total of 4 rules in 18 ms. Remains 654 /656 variables (removed 2) and now considering 572/574 (removed 2) transitions.
// Phase 1: matrix 572 rows 654 cols
[2021-05-14 08:50:40] [INFO ] Computed 138 place invariants in 1 ms
[2021-05-14 08:50:40] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 572 rows 654 cols
[2021-05-14 08:50:40] [INFO ] Computed 138 place invariants in 2 ms
[2021-05-14 08:50:41] [INFO ] State equation strengthened by 152 read => feed constraints.
[2021-05-14 08:50:41] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 654/658 places, 572/574 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : Parking-PT-832-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ 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}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (NEQ s485 0) (NEQ s446 1)), p0:(NEQ s608 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA Parking-PT-832-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Parking-PT-832-13 finished in 1843 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 658 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 658/658 places, 574/574 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 658 transition count 558
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 642 transition count 558
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 642 transition count 542
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 64 place count 626 transition count 542
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 625 transition count 541
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 625 transition count 541
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 132 place count 592 transition count 508
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 591 transition count 527
Applied a total of 134 rules in 52 ms. Remains 591 /658 variables (removed 67) and now considering 527/574 (removed 47) transitions.
// Phase 1: matrix 527 rows 591 cols
[2021-05-14 08:50:42] [INFO ] Computed 140 place invariants in 1 ms
[2021-05-14 08:50:42] [INFO ] Implicit Places using invariants in 224 ms returned [370, 382, 442, 552]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 225 ms to find 4 implicit places.
[2021-05-14 08:50:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 527 rows 587 cols
[2021-05-14 08:50:42] [INFO ] Computed 136 place invariants in 1 ms
[2021-05-14 08:50:42] [INFO ] Dead Transitions using invariants and state equation in 254 ms returned []
Starting structural reductions, iteration 1 : 587/658 places, 527/574 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 585 transition count 525
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 585 transition count 525
Applied a total of 4 rules in 24 ms. Remains 585 /587 variables (removed 2) and now considering 525/527 (removed 2) transitions.
// Phase 1: matrix 525 rows 585 cols
[2021-05-14 08:50:42] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:50:42] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 525 rows 585 cols
[2021-05-14 08:50:42] [INFO ] Computed 136 place invariants in 2 ms
[2021-05-14 08:50:42] [INFO ] State equation strengthened by 220 read => feed constraints.
[2021-05-14 08:50:43] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 585/658 places, 525/574 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : Parking-PT-832-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s405 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 512 reset in 573 ms.
Product exploration explored 100000 steps with 510 reset in 641 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 520 reset in 577 ms.
Product exploration explored 100000 steps with 509 reset in 641 ms.
[2021-05-14 08:50:47] [INFO ] Flatten gal took : 24 ms
[2021-05-14 08:50:47] [INFO ] Flatten gal took : 51 ms
[2021-05-14 08:50:47] [INFO ] Time to serialize gal into /tmp/LTL11160993517472165888.gal : 3 ms
[2021-05-14 08:50:47] [INFO ] Time to serialize properties into /tmp/LTL17947278082866480468.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/LTL11160993517472165888.gal, -t, CGAL, -LTL, /tmp/LTL17947278082866480468.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/LTL11160993517472165888.gal -t CGAL -LTL /tmp/LTL17947278082866480468.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p497!=1)"))))
Formula 0 simplified : !FG"(p497!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
[2021-05-14 08:51:02] [INFO ] Flatten gal took : 24 ms
[2021-05-14 08:51:02] [INFO ] Applying decomposition
[2021-05-14 08:51:02] [INFO ] Flatten gal took : 23 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/graph7253290056577508056.txt, -o, /tmp/graph7253290056577508056.bin, -w, /tmp/graph7253290056577508056.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/graph7253290056577508056.bin, -l, -1, -v, -w, /tmp/graph7253290056577508056.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:51:02] [INFO ] Decomposing Gal with order
[2021-05-14 08:51:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:51:02] [INFO ] Removed a total of 707 redundant transitions.
[2021-05-14 08:51:02] [INFO ] Flatten gal took : 39 ms
[2021-05-14 08:51:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 22 ms.
[2021-05-14 08:51:02] [INFO ] Time to serialize gal into /tmp/LTL10386105358103819168.gal : 4 ms
[2021-05-14 08:51:02] [INFO ] Time to serialize properties into /tmp/LTL16565676477828874963.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/LTL10386105358103819168.gal, -t, CGAL, -LTL, /tmp/LTL16565676477828874963.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/LTL10386105358103819168.gal -t CGAL -LTL /tmp/LTL16565676477828874963.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i9.u156.p497!=1)"))))
Formula 0 simplified : !FG"(i9.u156.p497!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.8311e+10 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8367109504010053113
[2021-05-14 08:51:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8367109504010053113
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/ltsmin8367109504010053113]
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/ltsmin8367109504010053113] 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/ltsmin8367109504010053113] 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-832-14 finished in 36595 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5612365028544596367
[2021-05-14 08:51:18] [INFO ] Computing symmetric may disable matrix : 574 transitions.
[2021-05-14 08:51:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:51:18] [INFO ] Computing symmetric may enable matrix : 574 transitions.
[2021-05-14 08:51:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:51:18] [INFO ] Applying decomposition
[2021-05-14 08:51:18] [INFO ] Flatten gal took : 17 ms
[2021-05-14 08:51:18] [INFO ] Computing Do-Not-Accords matrix : 574 transitions.
[2021-05-14 08:51:18] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:51:18] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5612365028544596367
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/ltsmin5612365028544596367]
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/graph13111446387980947717.txt, -o, /tmp/graph13111446387980947717.bin, -w, /tmp/graph13111446387980947717.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/graph13111446387980947717.bin, -l, -1, -v, -w, /tmp/graph13111446387980947717.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:51:21] [INFO ] Decomposing Gal with order
[2021-05-14 08:51:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:51:21] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-14 08:51:21] [INFO ] Flatten gal took : 63 ms
[2021-05-14 08:51:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-14 08:51:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality12781590702674027991.gal : 9 ms
[2021-05-14 08:51:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality8249896174167188701.ltl : 256 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/LTLCardinality12781590702674027991.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8249896174167188701.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/LTLCardinality12781590702674027991.gal -t CGAL -LTL /tmp/LTLCardinality8249896174167188701.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X(F(("(i5.u80.p195!=1)")||(G(F("((i4.u64.p132==0)||(i15.u233.p693==1))"))))))))
Formula 0 simplified : !XXF("(i5.u80.p195!=1)" | GF"((i4.u64.p132==0)||(i15.u233.p693==1))")
Compilation finished in 3759 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5612365028544596367]
Link finished in 49 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, --when, --ltl, X(X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5612365028544596367]
Reverse transition relation is NOT exact ! Due to transitions i4.u77.t412, i5.u100.t354, i6.i1.u123.t296, i8.u147.t238, i11.i1.t878, i11.i1.i1.t879, i11.i1.i1.t857, i11.i1.i1.t854, i11.i1.i2.u173.t178, i11.i1.i2.u173.t180, i12.u197.t122, i14.u221.t64, i15.u246.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/561/13/574
Computing Next relation with stutter on 7.8311e+10 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
963 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.7073,338280,1,0,742246,3608,9528,1.45411e+06,637,14449,854557
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(((i11.i1.i0.u157.p448==0)||(i4.u56.p113==1))&&((i14.u221.p658==0)||(i12.u182.p521==1)))"))))
Formula 1 simplified : !FG"(((i11.i1.i0.u157.p448==0)||(i4.u56.p113==1))&&((i14.u221.p658==0)||(i12.u182.p521==1)))"
Computing Next relation with stutter on 7.8311e+10 deadlock states
WARNING : LTSmin timed out (>450 s) on command 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, --when, --ltl, X(X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5612365028544596367]
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, <>([]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5612365028544596367]
LTSmin run took 2806 ms.
FORMULA Parking-PT-832-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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, <>((LTLAPp3==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin5612365028544596367]
LTSmin run took 2407 ms.
FORMULA Parking-PT-832-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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, <>([]((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5612365028544596367]
WARNING : LTSmin timed out (>450 s) on command 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, <>([]((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5612365028544596367]
Retrying LTSmin with larger timeout 3600 s
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, <>([]((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5612365028544596367]
LTSmin run took 2833 ms.
FORMULA Parking-PT-832-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620983191575

--------------------
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
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ 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-832"
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-832, 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-162089127900444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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