Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477500284.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HirschbergSinclair-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477500284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 9.9K Apr 29 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 29 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 16:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 16:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 9 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 173K May 10 09:34 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 HirschbergSinclair-PT-15-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652740946619

Running Version 202205111006
[2022-05-16 22:42:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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]
[2022-05-16 22:42:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:42:29] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2022-05-16 22:42:29] [INFO ] Transformed 330 places.
[2022-05-16 22:42:29] [INFO ] Transformed 296 transitions.
[2022-05-16 22:42:29] [INFO ] Parsed PT model containing 330 places and 296 transitions in 453 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HirschbergSinclair-PT-15-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 315 transition count 296
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 27 place count 303 transition count 284
Iterating global reduction 1 with 12 rules applied. Total rules applied 39 place count 303 transition count 284
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 292 transition count 273
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 292 transition count 273
Applied a total of 61 rules in 177 ms. Remains 292 /330 variables (removed 38) and now considering 273/296 (removed 23) transitions.
// Phase 1: matrix 273 rows 292 cols
[2022-05-16 22:42:30] [INFO ] Computed 19 place invariants in 42 ms
[2022-05-16 22:42:30] [INFO ] Implicit Places using invariants in 770 ms returned []
// Phase 1: matrix 273 rows 292 cols
[2022-05-16 22:42:30] [INFO ] Computed 19 place invariants in 8 ms
[2022-05-16 22:42:31] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
// Phase 1: matrix 273 rows 292 cols
[2022-05-16 22:42:31] [INFO ] Computed 19 place invariants in 8 ms
[2022-05-16 22:42:31] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 292/330 places, 273/296 transitions.
Finished structural reductions, in 1 iterations. Remains : 292/330 places, 273/296 transitions.
Support contains 31 out of 292 places after structural reductions.
[2022-05-16 22:42:32] [INFO ] Flatten gal took : 87 ms
[2022-05-16 22:42:32] [INFO ] Flatten gal took : 44 ms
[2022-05-16 22:42:32] [INFO ] Input system was already deterministic with 273 transitions.
Finished random walk after 1287 steps, including 4 resets, run visited all 23 properties in 131 ms. (steps per millisecond=9 )
FORMULA HirschbergSinclair-PT-15-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 292 stabilizing places and 273 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 292 transition count 273
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(G(p0))) U F(X(p0)))))'
Support contains 2 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 288 transition count 269
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 288 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 286 transition count 267
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 286 transition count 267
Applied a total of 12 rules in 68 ms. Remains 286 /292 variables (removed 6) and now considering 267/273 (removed 6) transitions.
// Phase 1: matrix 267 rows 286 cols
[2022-05-16 22:42:32] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-16 22:42:33] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 267 rows 286 cols
[2022-05-16 22:42:33] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-16 22:42:34] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
// Phase 1: matrix 267 rows 286 cols
[2022-05-16 22:42:34] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-16 22:42:34] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/292 places, 267/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 286/292 places, 267/273 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1630 reset in 676 ms.
Product exploration explored 100000 steps with 1633 reset in 398 ms.
Computed a total of 286 stabilizing places and 267 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 286 transition count 267
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 267 rows 286 cols
[2022-05-16 22:42:36] [INFO ] Computed 19 place invariants in 4 ms
[2022-05-16 22:42:36] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 50 ms returned sat
[2022-05-16 22:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:42:38] [INFO ] [Real]Absence check using state equation in 1054 ms returned sat
[2022-05-16 22:42:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:42:38] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 28 ms returned sat
[2022-05-16 22:42:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:42:39] [INFO ] [Nat]Absence check using state equation in 1148 ms returned sat
[2022-05-16 22:42:39] [INFO ] Computed and/alt/rep : 178/623/178 causal constraints (skipped 74 transitions) in 30 ms.
[2022-05-16 22:42:41] [INFO ] Added : 143 causal constraints over 29 iterations in 2174 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 267/267 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 272 transition count 145
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 164 transition count 145
Applied a total of 216 rules in 39 ms. Remains 164 /286 variables (removed 122) and now considering 145/267 (removed 122) transitions.
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:42:41] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:42:41] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:42:41] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 22:42:42] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2022-05-16 22:42:42] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:42:42] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 22:42:42] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/286 places, 145/267 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/286 places, 145/267 transitions.
Computed a total of 164 stabilizing places and 145 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 164 transition count 145
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:42:43] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:42:43] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 34 ms returned sat
[2022-05-16 22:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:42:44] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2022-05-16 22:42:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:42:44] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 34 ms returned sat
[2022-05-16 22:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:42:44] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2022-05-16 22:42:44] [INFO ] Computed and/alt/rep : 119/196/119 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-16 22:42:45] [INFO ] Added : 63 causal constraints over 13 iterations in 601 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2416 reset in 454 ms.
Product exploration explored 100000 steps with 2427 reset in 580 ms.
Built C files in :
/tmp/ltsmin2199460684617758296
[2022-05-16 22:42:46] [INFO ] Computing symmetric may disable matrix : 145 transitions.
[2022-05-16 22:42:46] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:42:46] [INFO ] Computing symmetric may enable matrix : 145 transitions.
[2022-05-16 22:42:46] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:42:46] [INFO ] Computing Do-Not-Accords matrix : 145 transitions.
[2022-05-16 22:42:46] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:42:46] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2199460684617758296
Running compilation step : cd /tmp/ltsmin2199460684617758296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 875 ms.
Running link step : cd /tmp/ltsmin2199460684617758296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin2199460684617758296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8315704585372706011.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 145/145 transitions.
Applied a total of 0 rules in 16 ms. Remains 164 /164 variables (removed 0) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:43:01] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:01] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:43:01] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:02] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2022-05-16 22:43:02] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:43:02] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:02] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 145/145 transitions.
Built C files in :
/tmp/ltsmin16451895372852851724
[2022-05-16 22:43:02] [INFO ] Computing symmetric may disable matrix : 145 transitions.
[2022-05-16 22:43:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:02] [INFO ] Computing symmetric may enable matrix : 145 transitions.
[2022-05-16 22:43:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:02] [INFO ] Computing Do-Not-Accords matrix : 145 transitions.
[2022-05-16 22:43:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16451895372852851724
Running compilation step : cd /tmp/ltsmin16451895372852851724;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 454 ms.
Running link step : cd /tmp/ltsmin16451895372852851724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16451895372852851724;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11743548135107973225.hoa' '--buchi-type=spotba'
LTSmin run took 1584 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLFireability-00 finished in 31654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(p0))) U p1))'
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 278 transition count 151
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 170 transition count 151
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 220 place count 166 transition count 147
Iterating global reduction 2 with 4 rules applied. Total rules applied 224 place count 166 transition count 147
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 225 place count 166 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 165 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 227 place count 164 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 164 transition count 145
Applied a total of 228 rules in 32 ms. Remains 164 /292 variables (removed 128) and now considering 145/273 (removed 128) transitions.
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:43:04] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:04] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:43:04] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:05] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2022-05-16 22:43:05] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 145 rows 164 cols
[2022-05-16 22:43:05] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:05] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/292 places, 145/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/292 places, 145/273 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s140 1)), p0:(GEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 639 steps with 16 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-01 finished in 848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(!((X(X(p0))||G((p1 U p2))) U p2))))))'
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 290 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 290 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 288 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 288 transition count 269
Applied a total of 8 rules in 23 ms. Remains 288 /292 variables (removed 4) and now considering 269/273 (removed 4) transitions.
// Phase 1: matrix 269 rows 288 cols
[2022-05-16 22:43:05] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:05] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 269 rows 288 cols
[2022-05-16 22:43:05] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:06] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
// Phase 1: matrix 269 rows 288 cols
[2022-05-16 22:43:06] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:06] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 288/292 places, 269/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 288/292 places, 269/273 transitions.
Stuttering acceptance computed with spot in 412 ms :[p2, p2, (AND p0 p2), p2, (AND p0 p2), (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={0} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=4 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 3}], [{ cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={} source=6 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s284 1)), p1:(GEQ s272 1), p0:(AND (GEQ s7 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 339 reset in 253 ms.
Product exploration explored 100000 steps with 339 reset in 294 ms.
Computed a total of 288 stabilizing places and 269 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 288 transition count 269
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 7 states, 17 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-15-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-04 finished in 2701 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F((p0 U F(X(G(p1))))) U !F(p0)))'
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 278 transition count 153
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 172 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 216 place count 168 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 220 place count 168 transition count 149
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 168 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 167 transition count 148
Applied a total of 222 rules in 30 ms. Remains 167 /292 variables (removed 125) and now considering 148/273 (removed 125) transitions.
// Phase 1: matrix 148 rows 167 cols
[2022-05-16 22:43:08] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:08] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 148 rows 167 cols
[2022-05-16 22:43:08] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:08] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2022-05-16 22:43:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 148 rows 167 cols
[2022-05-16 22:43:08] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-16 22:43:08] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/292 places, 148/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 167/292 places, 148/273 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s107 1), p1:(AND (GEQ s14 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1032 reset in 301 ms.
Product exploration explored 100000 steps with 1029 reset in 339 ms.
Computed a total of 167 stabilizing places and 148 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 167 transition count 148
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 318 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 314 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
// Phase 1: matrix 148 rows 167 cols
[2022-05-16 22:43:10] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:10] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 23 ms returned sat
[2022-05-16 22:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:43:10] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-16 22:43:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:43:11] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 24 ms returned sat
[2022-05-16 22:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:43:11] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-16 22:43:11] [INFO ] Computed and/alt/rep : 110/115/110 causal constraints (skipped 11 transitions) in 9 ms.
[2022-05-16 22:43:11] [INFO ] Added : 52 causal constraints over 11 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 167 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 148/148 transitions.
Applied a total of 0 rules in 11 ms. Remains 167 /167 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 167 cols
[2022-05-16 22:43:11] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:11] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 148 rows 167 cols
[2022-05-16 22:43:11] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:12] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2022-05-16 22:43:12] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 148 rows 167 cols
[2022-05-16 22:43:12] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:12] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 167/167 places, 148/148 transitions.
Computed a total of 167 stabilizing places and 148 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 167 transition count 148
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 92 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 148 rows 167 cols
[2022-05-16 22:43:13] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:13] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 33 ms returned sat
[2022-05-16 22:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:43:13] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2022-05-16 22:43:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:43:13] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 33 ms returned sat
[2022-05-16 22:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:43:14] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-16 22:43:14] [INFO ] Computed and/alt/rep : 110/115/110 causal constraints (skipped 11 transitions) in 17 ms.
[2022-05-16 22:43:14] [INFO ] Added : 52 causal constraints over 11 iterations in 211 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1111 reset in 297 ms.
Product exploration explored 100000 steps with 1110 reset in 337 ms.
Built C files in :
/tmp/ltsmin12944609059723003714
[2022-05-16 22:43:14] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2022-05-16 22:43:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:14] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2022-05-16 22:43:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:14] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2022-05-16 22:43:14] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:14] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12944609059723003714
Running compilation step : cd /tmp/ltsmin12944609059723003714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 623 ms.
Running link step : cd /tmp/ltsmin12944609059723003714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12944609059723003714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16136213288377379502.hoa' '--buchi-type=spotba'
LTSmin run took 892 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLFireability-05 finished in 8483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 2 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 277 transition count 142
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 161 transition count 142
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 235 place count 158 transition count 139
Iterating global reduction 2 with 3 rules applied. Total rules applied 238 place count 158 transition count 139
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 158 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 157 transition count 138
Applied a total of 240 rules in 19 ms. Remains 157 /292 variables (removed 135) and now considering 138/273 (removed 135) transitions.
// Phase 1: matrix 138 rows 157 cols
[2022-05-16 22:43:16] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:16] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 138 rows 157 cols
[2022-05-16 22:43:16] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:17] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2022-05-16 22:43:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 138 rows 157 cols
[2022-05-16 22:43:17] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:17] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/292 places, 138/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/292 places, 138/273 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s63 1), p1:(GEQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-06 finished in 895 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(X(G((G(p0) U p1))))))||F(p0)))'
Support contains 2 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 288 transition count 269
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 285 transition count 266
Applied a total of 14 rules in 20 ms. Remains 285 /292 variables (removed 7) and now considering 266/273 (removed 7) transitions.
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:17] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:17] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:17] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:18] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:18] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:18] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/292 places, 266/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 285/292 places, 266/273 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (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 : HirschbergSinclair-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GEQ s97 1), p1:(GEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 902 reset in 357 ms.
Product exploration explored 100000 steps with 902 reset in 411 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 113 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:20] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:20] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 50 ms returned sat
[2022-05-16 22:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:43:21] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2022-05-16 22:43:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:43:21] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 54 ms returned sat
[2022-05-16 22:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:43:22] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2022-05-16 22:43:22] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 33 ms.
[2022-05-16 22:43:22] [INFO ] Added : 49 causal constraints over 10 iterations in 468 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 285 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 270 transition count 137
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 156 transition count 137
Applied a total of 228 rules in 20 ms. Remains 156 /285 variables (removed 129) and now considering 137/266 (removed 129) transitions.
// Phase 1: matrix 137 rows 156 cols
[2022-05-16 22:43:22] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:22] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 137 rows 156 cols
[2022-05-16 22:43:22] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:23] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2022-05-16 22:43:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 137 rows 156 cols
[2022-05-16 22:43:23] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:23] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/285 places, 137/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/285 places, 137/266 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 137 rows 156 cols
[2022-05-16 22:43:24] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:24] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 30 ms returned sat
[2022-05-16 22:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:43:24] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-05-16 22:43:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:43:24] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 41 ms returned sat
[2022-05-16 22:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:43:24] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-05-16 22:43:24] [INFO ] Computed and/alt/rep : 108/113/108 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-16 22:43:25] [INFO ] Added : 9 causal constraints over 2 iterations in 91 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2041 reset in 392 ms.
Product exploration explored 100000 steps with 2040 reset in 435 ms.
Built C files in :
/tmp/ltsmin11439925225246133706
[2022-05-16 22:43:25] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2022-05-16 22:43:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:25] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2022-05-16 22:43:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:25] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2022-05-16 22:43:25] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 22:43:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11439925225246133706
Running compilation step : cd /tmp/ltsmin11439925225246133706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 639 ms.
Running link step : cd /tmp/ltsmin11439925225246133706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11439925225246133706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12031970479274558037.hoa' '--buchi-type=spotba'
LTSmin run took 112 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLFireability-07 finished in 9278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U !p1)&&X(p2)))'
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 288 transition count 269
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 285 transition count 266
Applied a total of 14 rules in 14 ms. Remains 285 /292 variables (removed 7) and now considering 266/273 (removed 7) transitions.
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:26] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:26] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:26] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:27] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:27] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:28] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/292 places, 266/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 285/292 places, 266/273 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) p1), true, (NOT p0), p1, (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s129 1)), p0:(GEQ s75 1), p2:(AND (GEQ s102 1) (GEQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-08 finished in 1593 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0)&&p1) U X(p2))||X(p3)))'
Support contains 5 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 289 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 289 transition count 270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 287 transition count 268
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 287 transition count 268
Applied a total of 10 rules in 20 ms. Remains 287 /292 variables (removed 5) and now considering 268/273 (removed 5) transitions.
// Phase 1: matrix 268 rows 287 cols
[2022-05-16 22:43:28] [INFO ] Computed 19 place invariants in 6 ms
[2022-05-16 22:43:28] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 268 rows 287 cols
[2022-05-16 22:43:28] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:29] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 287 cols
[2022-05-16 22:43:29] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:29] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 287/292 places, 268/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 287/292 places, 268/273 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 4}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 4}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p1 p0), acceptance={} source=6 dest: 1}]], initial=6, aps=[p2:(AND (GEQ s101 1) (GEQ s69 1)), p3:(AND (GEQ s29 1) (GEQ s286 1)), p1:(GEQ s265 1), p0:(GEQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-11 finished in 1894 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(X(G(p0)))))))'
Support contains 1 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 277 transition count 141
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 160 transition count 141
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 238 place count 156 transition count 137
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 156 transition count 137
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 156 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 155 transition count 136
Applied a total of 244 rules in 22 ms. Remains 155 /292 variables (removed 137) and now considering 136/273 (removed 137) transitions.
// Phase 1: matrix 136 rows 155 cols
[2022-05-16 22:43:30] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:30] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 136 rows 155 cols
[2022-05-16 22:43:30] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:30] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2022-05-16 22:43:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 136 rows 155 cols
[2022-05-16 22:43:30] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:30] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/292 places, 136/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 155/292 places, 136/273 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s116 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 151 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-12 finished in 782 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 277 transition count 141
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 160 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 237 place count 157 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 240 place count 157 transition count 138
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 157 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 156 transition count 137
Applied a total of 242 rules in 25 ms. Remains 156 /292 variables (removed 136) and now considering 137/273 (removed 136) transitions.
// Phase 1: matrix 137 rows 156 cols
[2022-05-16 22:43:31] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:31] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 137 rows 156 cols
[2022-05-16 22:43:31] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-16 22:43:31] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2022-05-16 22:43:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 137 rows 156 cols
[2022-05-16 22:43:31] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:31] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/292 places, 137/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/292 places, 137/273 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s35 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 3225 reset in 470 ms.
Product exploration explored 100000 steps with 3249 reset in 486 ms.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
// Phase 1: matrix 137 rows 156 cols
[2022-05-16 22:43:33] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:33] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 29 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA HirschbergSinclair-PT-15-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-13 finished in 3030 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!X(p0)) U G(p1))))'
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 273/273 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 288 transition count 269
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 285 transition count 266
Applied a total of 14 rules in 20 ms. Remains 285 /292 variables (removed 7) and now considering 266/273 (removed 7) transitions.
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:34] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:34] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:34] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-16 22:43:35] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 285 cols
[2022-05-16 22:43:35] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-16 22:43:35] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 285/292 places, 266/273 transitions.
Finished structural reductions, in 1 iterations. Remains : 285/292 places, 266/273 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s23 1) (GEQ s78 1)), p0:(GEQ s245 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32392 reset in 535 ms.
Product exploration explored 100000 steps with 32412 reset in 658 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 1010 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND p1 p0), true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :4
Finished Best-First random walk after 1972 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=123 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (AND p1 (NOT p0))), (F (AND p1 p0)), (F p1), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p0))
Knowledge based reduction with 12 factoid took 436 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA HirschbergSinclair-PT-15-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-14 finished in 5044 ms.
All properties solved by simple procedures.
Total runtime 70082 ms.

BK_STOP 1652741019585

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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=@none -Xss128m -Xms40m -Xmx8192m

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="HirschbergSinclair-PT-15"
export BK_EXAMINATION="LTLFireability"
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 HirschbergSinclair-PT-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477500284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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