Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 9.7K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 6.5K May 5 16:52 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 Sudoku-COL-AN01-CTLFireability-00
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-01
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-02
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-03
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-04
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-05
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-06
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-07
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-08
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-09
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-10
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-11
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-12
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-13
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-14
FORMULA_NAME Sudoku-COL-AN01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621193687634

Running Version 0
[2021-05-16 19:35:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 19:35:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 19:35:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-16 19:35:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 19:35:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 498 ms
[2021-05-16 19:35:02] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2021-05-16 19:35:02] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4 PT places and 1.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2021-05-16 19:35:02] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions in 4 ms.
[2021-05-16 19:35:02] [INFO ] Skeletonized HLPN properties in 11 ms.
Successfully produced net in file /tmp/petri1000_3227794958041649862.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-16 19:35:02] [INFO ] Flatten gal took : 32 ms
[2021-05-16 19:35:02] [INFO ] Flatten gal took : 1 ms
[2021-05-16 19:35:02] [INFO ] Unfolded HLPN to a Petri net with 4 places and 1 transitions in 1 ms.
[2021-05-16 19:35:02] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_10054019325073850831.dot
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4/4 places, 1/1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 7 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2021-05-16 19:35:02] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-16 19:35:02] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 1 rows 3 cols
[2021-05-16 19:35:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 19:35:02] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 3 cols
[2021-05-16 19:35:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 19:35:02] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 1/1 transitions.
[2021-05-16 19:35:02] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-16 19:35:02] [INFO ] Flatten gal took : 6 ms
FORMULA Sudoku-COL-AN01-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:35:02] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:35:02] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 407 ms. (steps per millisecond=245 ) properties (out of 14) seen :12
Running SMT prover for 2 properties.
// Phase 1: matrix 1 rows 3 cols
[2021-05-16 19:35:03] [INFO ] Computed 2 place invariants in 0 ms
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Applied a total of 0 rules in 2 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2021-05-16 19:35:03] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:35:03] [INFO ] Flatten gal took : 1 ms
[2021-05-16 19:35:03] [INFO ] Input system was already deterministic with 1 transitions.
[2021-05-16 19:35:03] [INFO ] Flatten gal took : 0 ms
[2021-05-16 19:35:03] [INFO ] Flatten gal took : 1 ms
[2021-05-16 19:35:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6817685797675776393.gal : 0 ms
[2021-05-16 19:35:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17406590777191238465.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6817685797675776393.gal, -t, CGAL, -ctl, /tmp/CTLFireability17406590777191238465.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6817685797675776393.gal -t CGAL -ctl /tmp/CTLFireability17406590777191238465.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.00441,4124,2,6,5,16,6,0,12,8,0


Converting to forward existential form...Done !
original formula: AF(AG(EF(AG((((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U !(E(TRUE U !((((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.006211,4572,1,0,6,20,18,4,56,13,12
FORMULA Sudoku-COL-AN01-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2021-05-16 19:35:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 19:35:03] [INFO ] Flatten gal took : 3 ms
[2021-05-16 19:35:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN01-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:35:03] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:35:03] [INFO ] Applying decomposition
[2021-05-16 19:35:03] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8131251095861405534.txt, -o, /tmp/graph8131251095861405534.bin, -w, /tmp/graph8131251095861405534.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8131251095861405534.bin, -l, -1, -v, -w, /tmp/graph8131251095861405534.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 19:35:03] [INFO ] Decomposing Gal with order
[2021-05-16 19:35:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 19:35:03] [INFO ] Flatten gal took : 11 ms
[2021-05-16 19:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-16 19:35:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8467396965922878463.gal : 1 ms
[2021-05-16 19:35:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15798796054861239864.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8467396965922878463.gal, -t, CGAL, -ctl, /tmp/CTLFireability15798796054861239864.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8467396965922878463.gal -t CGAL -ctl /tmp/CTLFireability15798796054861239864.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.001657,4228,8,3,14,8,9,3,4,5,0


Converting to forward existential form...Done !
original formula: !(EG((((((((((!(AG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) + (((!(A((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1))) + !(A((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U ((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) + !(E((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)) U EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1)) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1))))
=> equivalent forward existential formula: [FwdG(Init,(((((((((!(!(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))) + (((!(!((E(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U (!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) + EG(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1))) + !(!((E(!(((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U (!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * !(((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) + EG(!(((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))))) + !(E((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)) U EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1)) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.00846,4992,1,0,25,8,80,13,18,5,103
FORMULA Sudoku-COL-AN01-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !(AF(EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))] != FALSE
(forward)formula 1,1,0.008941,4992,1,0,25,8,80,13,18,5,103
FORMULA Sudoku-COL-AN01-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG((!(AF(((((AX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)))) + ((((E(E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) * (!(EX((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))) + !(E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))))
=> equivalent forward existential formula: [FwdG(Init,(!(!(EG(!(((((!(EX(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)))))) + ((((E(E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) * (!(EX((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))) + !(E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))))] != FALSE
(forward)formula 2,1,0.013068,4992,1,0,25,8,95,13,21,5,110
FORMULA Sudoku-COL-AN01-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (!(A(EF(((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U (!(EX(((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) + (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) + A(AG((!(AF((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) + (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) U AF(((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)) * (E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) + AG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))))
=> equivalent forward existential formula: (([(EY(((FwdU(Init,!((!(EX(((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) + (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * !(E(TRUE U ((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * ((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))] != FALSE + [FwdG(Init,!((!(EX(((((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))&&(u0.Rows_0>=1))&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) + (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))] != FALSE) + [((Init * !(EG(!(!(EG(!(((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)) * (E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) + !(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))))))))))) * !(E(!(!(EG(!(((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)) * (E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) + !(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))))))) U (!(!(E(TRUE U !((!(!(EG(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))) + (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))) * !(!(EG(!(((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)) * (E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) + !(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))))))))))))] != FALSE)
dead was empty
(forward)formula 3,0,0.023391,4992,1,0,25,8,99,13,21,5,114
FORMULA Sudoku-COL-AN01-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EX((EF((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))),TRUE) * (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))] != FALSE
(forward)formula 4,0,0.023889,4992,1,0,25,8,99,13,21,5,115
FORMULA Sudoku-COL-AN01-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(EX(EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))] = FALSE
(forward)formula 5,0,0.024359,4992,1,0,25,8,99,13,21,5,115
FORMULA Sudoku-COL-AN01-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: A(!(EX(EF((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) U AG(E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))))))))) * !(E(!(!(E(TRUE U !(E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))))) U (!(!(EX(E(TRUE U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))) * !(!(E(TRUE U !(E((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))))))))))] != FALSE
(forward)formula 6,0,0.028222,4992,1,0,25,8,99,13,21,5,116
FORMULA Sudoku-COL-AN01-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG((((A((!(A((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))) U ((((((((((EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) + (((AG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1))) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1))) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1)))
=> equivalent forward existential formula: [FwdG(Init,(((!((E(!(((((((((((EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) + (((!(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1))) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1))) U (!((!(!((E(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U (!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) + EG(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))) * (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))) * !(((((((((((EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) + (((!(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1))) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1))))) + EG(!(((((((((((EX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)) + (((!(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1))) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1)))))) + (u0.Rows_0<1)) + (u1.Cells_0<1)) + (u2.Columns_0<1)))] != FALSE
(forward)formula 7,0,0.037724,4992,1,0,25,8,102,14,21,5,118
FORMULA Sudoku-COL-AN01-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(((!(EG(AX((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) + !(AX((((((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))||(u0.Rows_0<1))||(u1.Cells_0<1))||(u2.Columns_0<1)) * !(A((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)) U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))))) + (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U AG((!(E(EF((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U AF((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))))
=> equivalent forward existential formula: [(FwdU(Init,((!(EG(!(EX(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))) + !(!(EX(!((((((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))||(u0.Rows_0<1))||(u1.Cells_0<1))||(u2.Columns_0<1)) * !(!((E(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U (!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) + EG(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))))))))) + (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * !(E(TRUE U !((!(E(E(TRUE U (((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) U !(EG(!((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))) * (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))))))] != FALSE
(forward)formula 8,1,0.042207,4992,1,0,25,8,109,14,21,5,125
FORMULA Sudoku-COL-AN01-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: A(!(EG(!(EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))))) U A(AX(((((AG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))) * EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1))) U EF((((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))) U (!(!(EX(!(((((!(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)))))) * !(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))))) + EG(!(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))))))))))) * !(E(!(!((E(!(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))) U (!(!(EX(!(((((!(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)))))) * !(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))))) + EG(!(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))))))) U (!(!(EG(!(EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))))) * !(!((E(!(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))) U (!(!(EX(!(((((!(E(TRUE U !((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1))))) * EG((((u0.Rows_0>=1)&&(u1.Cells_0>=1))&&(u2.Columns_0>=1)))) * (u0.Rows_0>=1)) * (u1.Cells_0>=1)) * (u2.Columns_0>=1)))))) * !(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1)))))) + EG(!(E(TRUE U (((u0.Rows_0<1)||(u1.Cells_0<1))||(u2.Columns_0<1))))))))))))] != FALSE
(forward)formula 9,1,0.046259,4992,1,0,25,8,112,14,21,5,125
FORMULA Sudoku-COL-AN01-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************


BK_STOP 1621193704544

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN01"
export BK_EXAMINATION="CTLFireability"
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 Sudoku-COL-AN01, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106745900394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN01.tgz
mv Sudoku-COL-AN01 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;