Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r192-tall-167838877000461.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is FunctionPointer-PT-c016, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r192-tall-167838877000461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1678581649722

Running Version 202205111006
[2023-03-12 00:40:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800]
[2023-03-12 00:40:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 00:40:52] [INFO ] Load time of PNML (sax parser for PT used): 567 ms
[2023-03-12 00:40:52] [INFO ] Transformed 2826 places.
[2023-03-12 00:40:52] [INFO ] Transformed 8960 transitions.
[2023-03-12 00:40:52] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 749 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 42 ms
Reduce places removed 1198 places and 2998 transitions.
Built sparse matrix representations for Structural reductions in 10 ms.26282KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 9876 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.51 ms
Discarding 17 places :
Also discarding 0 output transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 303 place count 1309 transition count 3662
Iterating global reduction 0 with 302 rules applied. Total rules applied 605 place count 1309 transition count 3662
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Iterating post reduction 0 with 352 rules applied. Total rules applied 957 place count 1309 transition count 3310
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 1115 place count 1151 transition count 2994
Iterating global reduction 1 with 158 rules applied. Total rules applied 1273 place count 1151 transition count 2994
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Iterating post reduction 1 with 64 rules applied. Total rules applied 1337 place count 1151 transition count 2930
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1351 place count 1137 transition count 2902
Iterating global reduction 2 with 14 rules applied. Total rules applied 1365 place count 1137 transition count 2902
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1379 place count 1123 transition count 2874
Iterating global reduction 2 with 14 rules applied. Total rules applied 1393 place count 1123 transition count 2874
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1407 place count 1109 transition count 2846
Iterating global reduction 2 with 14 rules applied. Total rules applied 1421 place count 1109 transition count 2846
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1435 place count 1095 transition count 2818
Iterating global reduction 2 with 14 rules applied. Total rules applied 1449 place count 1095 transition count 2818
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1463 place count 1081 transition count 2790
Iterating global reduction 2 with 14 rules applied. Total rules applied 1477 place count 1081 transition count 2790
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1491 place count 1067 transition count 2762
Iterating global reduction 2 with 14 rules applied. Total rules applied 1505 place count 1067 transition count 2762
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1519 place count 1053 transition count 2734
Iterating global reduction 2 with 14 rules applied. Total rules applied 1533 place count 1053 transition count 2734
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1596 place count 990 transition count 2496
Iterating global reduction 2 with 63 rules applied. Total rules applied 1659 place count 990 transition count 2496
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1722 place count 927 transition count 2244
Iterating global reduction 2 with 63 rules applied. Total rules applied 1785 place count 927 transition count 2244
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1848 place count 864 transition count 2104
Iterating global reduction 2 with 63 rules applied. Total rules applied 1911 place count 864 transition count 2104
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1974 place count 801 transition count 1978
Iterating global reduction 2 with 63 rules applied. Total rules applied 2037 place count 801 transition count 1978
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 2100 place count 738 transition count 1852
Iterating global reduction 2 with 63 rules applied. Total rules applied 2163 place count 738 transition count 1852
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 2226 place count 675 transition count 1726
Iterating global reduction 2 with 63 rules applied. Total rules applied 2289 place count 675 transition count 1726
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 2352 place count 612 transition count 1600
Iterating global reduction 2 with 63 rules applied. Total rules applied 2415 place count 612 transition count 1600
Computed a total of 192 stabilizing places and 512 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2422 place count 605 transition count 1586
Iterating global reduction 2 with 7 rules applied. Total rules applied 2429 place count 605 transition count 1586
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 2431 place count 605 transition count 1584
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Applied a total of 2431 rules in 2647 ms. Remains 605 /1628 variables (removed 1023) and now considering 1584/5962 (removed 4378) transitions.
Finished structural reductions, in 1 iterations. Remains : 605/1628 places, 1584/5962 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2103 ms (no deadlock found). (steps per millisecond=594 )
Random directed walk for 1250003 steps, including 0 resets, run took 2906 ms (no deadlock found). (steps per millisecond=430 )
[2023-03-12 00:41:00] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 00:41:00] [INFO ] Computed 2 place invariants in 26 ms
[2023-03-12 00:41:00] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 00:41:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 00:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:41:01] [INFO ] [Real]Absence check using state equation in 1336 ms returned sat
[2023-03-12 00:41:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:41:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 35 ms returned sat
[2023-03-12 00:41:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 00:41:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:41:02] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-12 00:41:02] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 00:41:02] [INFO ] [Nat]Added 262 Read/Feed constraints in 118 ms returned sat
[2023-03-12 00:41:03] [INFO ] Computed and/alt/rep : 204/290/202 causal constraints (skipped 853 transitions) in 208 ms.
[2023-03-12 00:41:03] [INFO ] Deduced a trap composed of 131 places in 324 ms of which 3 ms to minimize.
[2023-03-12 00:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2023-03-12 00:41:04] [INFO ] Added : 19 causal constraints over 5 iterations in 1355 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
Parikh directed walk for 37100 steps, including 37100 resets, run took 1038 ms. (steps per millisecond=35 )
Random directed walk for 500010 steps, including 0 resets, run took 1265 ms (no deadlock found). (steps per millisecond=395 )
Random walk for 500000 steps, including 0 resets, run took 841 ms (no deadlock found). (steps per millisecond=594 )
Random directed walk for 500005 steps, including 0 resets, run took 1207 ms (no deadlock found). (steps per millisecond=414 )
Random walk for 500001 steps, including 0 resets, run took 763 ms (no deadlock found). (steps per millisecond=655 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Applied a total of 0 rules in 91 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2023-03-12 00:41:09] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 00:41:09] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-12 00:41:10] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-12 00:41:10] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 00:41:10] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 00:41:10] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 00:41:14] [INFO ] Implicit Places using invariants and state equation in 4874 ms returned []
Implicit Place search using SMT with State Equation took 5380 ms to find 0 implicit places.
[2023-03-12 00:41:15] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-12 00:41:15] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 00:41:15] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 00:41:15] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1584/1584 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1517 ms (no deadlock found). (steps per millisecond=823 )
Random directed walk for 1250005 steps, including 0 resets, run took 2736 ms (no deadlock found). (steps per millisecond=456 )
[2023-03-12 00:41:19] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2023-03-12 00:41:19] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-12 00:41:20] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 00:41:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-12 00:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 00:41:21] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2023-03-12 00:41:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 00:41:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 43 ms returned sat
[2023-03-12 00:41:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 00:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 00:41:22] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-12 00:41:22] [INFO ] State equation strengthened by 262 read => feed constraints.
[2023-03-12 00:41:22] [INFO ] [Nat]Added 262 Read/Feed constraints in 166 ms returned sat
[2023-03-12 00:41:22] [INFO ] Computed and/alt/rep : 204/290/202 causal constraints (skipped 853 transitions) in 143 ms.
[2023-03-12 00:41:23] [INFO ] Deduced a trap composed of 131 places in 249 ms of which 1 ms to minimize.
[2023-03-12 00:41:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-12 00:41:23] [INFO ] Added : 19 causal constraints over 5 iterations in 1250 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
Parikh directed walk for 37100 steps, including 37100 resets, run took 984 ms. (steps per millisecond=37 )
Random directed walk for 500011 steps, including 0 resets, run took 1318 ms (no deadlock found). (steps per millisecond=379 )
Random walk for 500009 steps, including 0 resets, run took 813 ms (no deadlock found). (steps per millisecond=615 )
Random directed walk for 500004 steps, including 0 resets, run took 1192 ms (no deadlock found). (steps per millisecond=419 )
Random walk for 500002 steps, including 0 resets, run took 778 ms (no deadlock found). (steps per millisecond=642 )
[2023-03-12 00:41:29] [INFO ] Flatten gal took : 348 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11852965026228682019
[2023-03-12 00:41:29] [INFO ] Too many transitions (5962) to apply POR reductions. Disabling POR matrices.
[2023-03-12 00:41:29] [INFO ] Applying decomposition
[2023-03-12 00:41:29] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11852965026228682019
Running compilation step : cd /tmp/ltsmin11852965026228682019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2023-03-12 00:41:30] [INFO ] Flatten gal took : 209 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2886923269090924557.txt' '-o' '/tmp/graph2886923269090924557.bin' '-w' '/tmp/graph2886923269090924557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2886923269090924557.bin' '-l' '-1' '-v' '-w' '/tmp/graph2886923269090924557.weights' '-q' '0' '-e' '0.001'
[2023-03-12 00:41:30] [INFO ] Decomposing Gal with order
[2023-03-12 00:41:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-12 00:41:32] [INFO ] Removed a total of 7958 redundant transitions.
[2023-03-12 00:41:32] [INFO ] Flatten gal took : 1373 ms
[2023-03-12 00:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 5314 labels/synchronizations in 397 ms.
[2023-03-12 00:41:33] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock17567146525772316094.gal : 99 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock17567146525772316094.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...226
No direction supplied, using forward translation only.
Compilation finished in 21370 ms.
Running link step : cd /tmp/ltsmin11852965026228682019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 147 ms.
Running LTSmin : cd /tmp/ltsmin11852965026228682019;'/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' '-d'
Detected timeout of ITS tools.
[2023-03-12 00:51:46] [INFO ] Flatten gal took : 514 ms
[2023-03-12 00:51:46] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock3422105444176932824.gal : 70 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock3422105444176932824.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...246
No direction supplied, using forward translation only.
Detected timeout of ITS tools.
[2023-03-12 01:01:59] [INFO ] Flatten gal took : 333 ms
[2023-03-12 01:02:00] [INFO ] Input system was already deterministic with 5962 transitions.
[2023-03-12 01:02:00] [INFO ] Transformed 1628 places.
[2023-03-12 01:02:00] [INFO ] Transformed 5962 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-12 01:02:02] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock2339090669556440797.gal : 70 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock2339090669556440797.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...291
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityDeadlock -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 1800 -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="FunctionPointer-PT-c016"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool gold2022"
echo " Input is FunctionPointer-PT-c016, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r192-tall-167838877000461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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