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-162106746200554.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-PT-AN01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746200554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 11K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 3.3K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.3K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 1.9K 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-PT-AN01-CTLFireability-00
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-01
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-02
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-03
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-04
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-05
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-06
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-07
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-08
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-09
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-10
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-11
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-12
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-13
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-14
FORMULA_NAME Sudoku-PT-AN01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621231888071

Running Version 0
[2021-05-17 06:11:32] [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-17 06:11:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:11:32] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-17 06:11:32] [INFO ] Transformed 4 places.
[2021-05-17 06:11:32] [INFO ] Transformed 1 transitions.
[2021-05-17 06:11:32] [INFO ] Found NUPN structural information;
[2021-05-17 06:11:32] [INFO ] Completing missing partition info from NUPN : creating a component with [Columns_0_0]
[2021-05-17 06:11:32] [INFO ] Parsed PT model containing 4 places and 1 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
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-17 06:11:32] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-17 06:11:32] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 1 rows 3 cols
[2021-05-17 06:11:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 06:11:32] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 3 cols
[2021-05-17 06:11:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 06:11:32] [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-17 06:11:32] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-17 06:11:32] [INFO ] Flatten gal took : 15 ms
FORMULA Sudoku-PT-AN01-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 2 ms
[2021-05-17 06:11:33] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 100000 steps, including 50000 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 15) seen :12
Running SMT prover for 3 properties.
// Phase 1: matrix 1 rows 3 cols
[2021-05-17 06:11:33] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 06:11:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-17 06:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:11:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 06:11:33] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2021-05-17 06:11:33] [INFO ] Initial state test concluded for 1 properties.
FORMULA Sudoku-PT-AN01-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Applied a total of 0 rules in 3 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 0 ms
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 0 ms
[2021-05-17 06:11:33] [INFO ] Input system was already deterministic with 1 transitions.
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 1 ms
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 0 ms
[2021-05-17 06:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15650726532236998130.gal : 0 ms
[2021-05-17 06:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8991591028931817557.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15650726532236998130.gal, -t, CGAL, -ctl, /tmp/CTLFireability8991591028931817557.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/CTLFireability15650726532236998130.gal -t CGAL -ctl /tmp/CTLFireability8991591028931817557.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.005303,4192,2,6,5,16,6,0,12,8,0


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

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

Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 1 ms
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 1 ms
[2021-05-17 06:11:33] [INFO ] Input system was already deterministic with 1 transitions.
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 0 ms
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 1 ms
[2021-05-17 06:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12548270466464277518.gal : 1 ms
[2021-05-17 06:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7840720075629006148.ctl : 111 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/CTLFireability12548270466464277518.gal, -t, CGAL, -ctl, /tmp/CTLFireability7840720075629006148.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/CTLFireability12548270466464277518.gal -t CGAL -ctl /tmp/CTLFireability7840720075629006148.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.001464,4200,2,6,5,16,6,0,12,8,0


Converting to forward existential form...Done !
original formula: AF(((((!(A(A((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1)) U (((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1))) U EF((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1))))) * !(EF((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1))))) * (Rows_0_0==1)) * (Cells_0_0==1)) * (Columns_0_0==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((!(!((E(!(E(TRUE U (((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1)))) U (!(!((E(!((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1))) U (!((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1))) * !((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1))))) + EG(!((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1))))))) * !(E(TRUE U (((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1)))))) + EG(!(E(TRUE U (((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1)))))))) * !(E(TRUE U (((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1))))) * (Rows_0_0==1)) * (Cells_0_0==1)) * (Columns_0_0==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.007046,4640,1,0,6,21,32,5,75,16,20
FORMULA Sudoku-PT-AN01-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 0 ms
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 0 ms
[2021-05-17 06:11:33] [INFO ] Input system was already deterministic with 1 transitions.
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 0 ms
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 1 ms
[2021-05-17 06:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability468821418059828259.gal : 1 ms
[2021-05-17 06:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15401813734025373840.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/CTLFireability468821418059828259.gal, -t, CGAL, -ctl, /tmp/CTLFireability15401813734025373840.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/CTLFireability468821418059828259.gal -t CGAL -ctl /tmp/CTLFireability15401813734025373840.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.001393,4200,2,6,5,16,6,0,12,8,0


Converting to forward existential form...Done !
original formula: EG(AF((((!(AF((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1)))) * (Rows_0_0==1)) * (Cells_0_0==1)) * (Columns_0_0==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((!(!(EG(!((((Rows_0_0==1)&&(Cells_0_0==1))&&(Columns_0_0==1)))))) * (Rows_0_0==1)) * (Cells_0_0==1)) * (Columns_0_0==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
dead was empty
(forward)formula 0,0,0.003364,4640,1,0,6,21,26,4,71,16,14
FORMULA Sudoku-PT-AN01-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-17 06:11:33] [INFO ] Flatten gal took : 2 ms
[2021-05-17 06:11:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-PT-AN01-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 1 ms
[2021-05-17 06:11:33] [INFO ] Applying decomposition
[2021-05-17 06:11:33] [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/graph14686778476091226584.txt, -o, /tmp/graph14686778476091226584.bin, -w, /tmp/graph14686778476091226584.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/graph14686778476091226584.bin, -l, -1, -v, -w, /tmp/graph14686778476091226584.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 06:11:33] [INFO ] Decomposing Gal with order
[2021-05-17 06:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 06:11:33] [INFO ] Flatten gal took : 19 ms
[2021-05-17 06:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 06:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2030098001185767117.gal : 0 ms
[2021-05-17 06:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8903045843862168766.ctl : 2 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/CTLFireability2030098001185767117.gal, -t, CGAL, -ctl, /tmp/CTLFireability8903045843862168766.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/CTLFireability2030098001185767117.gal -t CGAL -ctl /tmp/CTLFireability8903045843862168766.ctl
No direction supplied, using forward translation only.
Parsed 8 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.001598,4212,8,3,14,8,9,3,4,5,0


Converting to forward existential form...Done !
original formula: !(EG((((((((((!(AG((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + (((!(A((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) * (u0.Rows_0_0==1)) * (u1.Cells_0_0==1)) * (u2.Columns_0_0==1))) + !(A((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U ((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) + !(E((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0)) U EX((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))) + (u0.Rows_0_0==0)) + (u1.Cells_0_0==0)) + (u2.Columns_0_0==0)) + (u0.Rows_0_0==0)) + (u1.Cells_0_0==0)) + (u2.Columns_0_0==0))))
=> equivalent forward existential formula: [FwdG(Init,(((((((((!(!(E(TRUE U !((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))) + (((!(!((E(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) U (!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) * !((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) + EG(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))) * (u0.Rows_0_0==1)) * (u1.Cells_0_0==1)) * (u2.Columns_0_0==1))) + !(!((E(!(((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) U (!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) * !(((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) + EG(!(((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))))) + !(E((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0)) U EX((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))) + (u0.Rows_0_0==0)) + (u1.Cells_0_0==0)) + (u2.Columns_0_0==0)) + (u0.Rows_0_0==0)) + (u1.Cells_0_0==0)) + (u2.Columns_0_0==0)))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.008343,4976,1,0,25,8,63,13,17,5,84
FORMULA Sudoku-PT-AN01-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AF(EX((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))] != FALSE
(forward)formula 1,1,0.008765,4976,1,0,25,8,63,13,17,5,84
FORMULA Sudoku-PT-AN01-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((!(AF(((((AX((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) * E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) * (u0.Rows_0_0==1)) * (u1.Cells_0_0==1)) * (u2.Columns_0_0==1)))) + ((((E(E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) U (((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0))) * (u0.Rows_0_0==1)) * (u1.Cells_0_0==1)) * (u2.Columns_0_0==1)) * (!(EX((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0)))) + !(E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))))
=> equivalent forward existential formula: [FwdG(Init,(!(!(EG(!(((((!(EX(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) * E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) * (u0.Rows_0_0==1)) * (u1.Cells_0_0==1)) * (u2.Columns_0_0==1)))))) + ((((E(E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) U (((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0))) * (u0.Rows_0_0==1)) * (u1.Cells_0_0==1)) * (u2.Columns_0_0==1)) * (!(EX((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0)))) + !(E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))))] != FALSE
(forward)formula 2,1,0.012956,4976,1,0,25,8,78,13,20,5,91
FORMULA Sudoku-PT-AN01-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(A(EF(((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) U (!(EX(((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) + A(AG((!(AF((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) U AF(((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0)) * (E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) + AG((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))))
=> equivalent forward existential formula: (([(EY(((FwdU(Init,!((!(EX(((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) * !(E(TRUE U ((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) * !((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) * ((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))] != FALSE + [FwdG(Init,!((!(EX(((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))] != FALSE) + [((Init * !(EG(!(!(EG(!(((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0)) * (E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) + !(E(TRUE U !((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))))))))))) * !(E(!(!(EG(!(((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0)) * (E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) + !(E(TRUE U !((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))))))) U (!(!(E(TRUE U !((!(!(EG(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))) + (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))) * !(!(EG(!(((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0)) * (E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) + !(E(TRUE U !((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))))))))))))] != FALSE)
dead was empty
(forward)formula 3,0,0.02371,4976,1,0,25,8,82,13,20,5,95
FORMULA Sudoku-PT-AN01-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((EF((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) * (((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * (((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0))),TRUE) * (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))] != FALSE
(forward)formula 4,0,0.02427,4976,1,0,25,8,82,13,20,5,96
FORMULA Sudoku-PT-AN01-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EX(EG((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EG((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))] = FALSE
(forward)formula 5,0,0.024781,4976,1,0,25,8,82,13,20,5,96
FORMULA Sudoku-PT-AN01-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AF((AF((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) * AX((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))) * !(AG(((!(AF((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) * (((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0))) * EF((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))))
=> equivalent forward existential formula: (([(FwdU((Init * !(!(EG(!((!(EG(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) * !(EX(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))))))),TRUE) * !(EG(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))] != FALSE + [(FwdU((Init * !(!(EG(!((!(EG(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) * !(EX(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))))))),TRUE) * !((((u0.Rows_0_0==0)||(u1.Cells_0_0==0))||(u2.Columns_0_0==0))))] != FALSE) + [(FwdU((Init * !(!(EG(!((!(EG(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))) * !(EX(!((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))))))))),TRUE) * !(E(TRUE U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))] != FALSE)
(forward)formula 6,1,0.026016,4976,1,0,25,8,82,14,20,5,96
FORMULA Sudoku-PT-AN01-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX((EG((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) * ((((AF(((!(E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + ((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) + (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + AG((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + (u0.Rows_0_0==0)) + (u1.Cells_0_0==0)) + (u2.Columns_0_0==0))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))] = FALSE * [(FwdU(((((EY(Init) * !((u2.Columns_0_0==0))) * !((u1.Cells_0_0==0))) * !((u0.Rows_0_0==0))) * !(!(EG(!(((!(E((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)) U (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))) + ((((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))&&(u0.Rows_0_0==1))&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))) + (((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1)))))))),TRUE) * !((((u0.Rows_0_0==1)&&(u1.Cells_0_0==1))&&(u2.Columns_0_0==1))))] = FALSE)
(forward)formula 7,0,0.028257,4976,1,0,25,8,85,14,20,5,96
FORMULA Sudoku-PT-AN01-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621231895440

--------------------
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-PT-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-PT-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-162106746200554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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