fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r453-smll-167912645800679
Last Updated
May 14, 2023

About the Execution of ITS-Tools for StigmergyElection-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16218.315 512464.00 1079218.00 12398.60 T??F???FFF?????? normal

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.r453-smll-167912645800679.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 itstools
Input is StigmergyElection-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645800679
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 16:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 37M Mar 5 18:23 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 StigmergyElection-PT-09b-ReachabilityFireability-00
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-01
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-02
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-03
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-04
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-05
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-06
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-07
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-08
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-09
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-10
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-11
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-12
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-13
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-14
FORMULA_NAME StigmergyElection-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679435710375

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09b
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-21 21:55:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 21:55:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:55:16] [INFO ] Load time of PNML (sax parser for PT used): 2234 ms
[2023-03-21 21:55:16] [INFO ] Transformed 1243 places.
[2023-03-21 21:55:16] [INFO ] Transformed 41210 transitions.
[2023-03-21 21:55:16] [INFO ] Found NUPN structural information;
[2023-03-21 21:55:16] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 2587 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 64 resets, run finished after 1842 ms. (steps per millisecond=5 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
[2023-03-21 21:55:24] [INFO ] Flatten gal took : 5760 ms
Interrupted probabilistic random walk after 40163 steps, run timeout after 6001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 40163 steps, saw 12213 distinct states, run finished after 6002 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 41210 rows 1243 cols
[2023-03-21 21:55:26] [INFO ] Computed 10 place invariants in 1065 ms
[2023-03-21 21:55:27] [INFO ] After 1216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-21 21:55:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 21:55:29] [INFO ] Flatten gal took : 4605 ms
[2023-03-21 21:55:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17069252247078336156.gal : 921 ms
[2023-03-21 21:55:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1236796470670958996.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17069252247078336156.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1236796470670958996.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2023-03-21 21:55:52] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
FORMULA StigmergyElection-PT-09b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-09b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-09b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-09b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 74 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 41210/41210 transitions.
Graph (trivial) has 1049 edges and 1243 vertex of which 186 / 1243 are part of one of the 27 SCC in 25 ms
Free SCC test removed 159 places
Drop transitions removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Graph (complete) has 2887 edges and 1084 vertex of which 1066 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.203 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 621 transitions
Trivial Post-agglo rules discarded 621 transitions
Performed 621 trivial Post agglomeration. Transition count delta: 621
Iterating post reduction 0 with 630 rules applied. Total rules applied 632 place count 1066 transition count 40368
Reduce places removed 621 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 639 rules applied. Total rules applied 1271 place count 445 transition count 40350
Reduce places removed 9 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 2 with 64 rules applied. Total rules applied 1335 place count 436 transition count 40295
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1390 place count 381 transition count 40295
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 63 Pre rules applied. Total rules applied 1390 place count 381 transition count 40232
Deduced a syphon composed of 63 places in 35 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 1516 place count 318 transition count 40232
Discarding 93 places :
Symmetric choice reduction at 4 with 93 rule applications. Total rules 1609 place count 225 transition count 40139
Iterating global reduction 4 with 93 rules applied. Total rules applied 1702 place count 225 transition count 40139
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 1719 place count 225 transition count 40122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1719 place count 225 transition count 40121
Deduced a syphon composed of 1 places in 36 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1721 place count 224 transition count 40121
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1739 place count 206 transition count 40086
Iterating global reduction 5 with 18 rules applied. Total rules applied 1757 place count 206 transition count 40086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1758 place count 206 transition count 40085
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1766 place count 198 transition count 40077
Iterating global reduction 6 with 8 rules applied. Total rules applied 1774 place count 198 transition count 40077
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 15 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 1812 place count 179 transition count 40058
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1820 place count 171 transition count 40050
Iterating global reduction 6 with 8 rules applied. Total rules applied 1828 place count 171 transition count 40050
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1836 place count 167 transition count 40058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1837 place count 167 transition count 40057
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1838 place count 167 transition count 40056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1839 place count 166 transition count 40056
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1848 place count 157 transition count 40047
Iterating global reduction 8 with 9 rules applied. Total rules applied 1857 place count 157 transition count 40047
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1867 place count 157 transition count 40047
Applied a total of 1867 rules in 7890 ms. Remains 157 /1243 variables (removed 1086) and now considering 40047/41210 (removed 1163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7900 ms. Remains : 157/1243 places, 40047/41210 transitions.
Incomplete random walk after 10000 steps, including 309 resets, run finished after 1273 ms. (steps per millisecond=7 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Loading property file /tmp/ReachabilityCardinality1236796470670958996.prop.
Interrupted probabilistic random walk after 65091 steps, run timeout after 6001 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 65091 steps, saw 15208 distinct states, run finished after 6001 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 40047 rows 157 cols
[2023-03-21 21:56:10] [INFO ] Computed 10 place invariants in 400 ms
[2023-03-21 21:56:10] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 21:56:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-21 21:56:35] [INFO ] After 24950ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-21 21:56:35] [INFO ] State equation strengthened by 17 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 21:56:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:56:35] [INFO ] After 25204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 74 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 40047/40047 transitions.
Applied a total of 0 rules in 655 ms. Remains 157 /157 variables (removed 0) and now considering 40047/40047 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 157/157 places, 40047/40047 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 40047/40047 transitions.
Applied a total of 0 rules in 651 ms. Remains 157 /157 variables (removed 0) and now considering 40047/40047 (removed 0) transitions.
[2023-03-21 21:56:36] [INFO ] Invariant cache hit.
[2023-03-21 21:56:36] [INFO ] Implicit Places using invariants in 135 ms returned [156]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 184 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/157 places, 40047/40047 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 156 transition count 40046
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 40046
Performed 9 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 9 places in 15 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 146 transition count 40026
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 146 transition count 40022
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 146 transition count 40022
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 36 place count 146 transition count 40017
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 141 transition count 40012
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 141 transition count 40012
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 140 transition count 40011
Applied a total of 47 rules in 13958 ms. Remains 140 /156 variables (removed 16) and now considering 40011/40047 (removed 36) transitions.
// Phase 1: matrix 40011 rows 140 cols
[2023-03-21 21:56:51] [INFO ] Computed 9 place invariants in 441 ms
[2023-03-21 21:56:51] [INFO ] Implicit Places using invariants in 535 ms returned []
Implicit Place search using SMT only with invariants took 536 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/157 places, 40011/40047 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15329 ms. Remains : 140/157 places, 40011/40047 transitions.
Incomplete random walk after 10000 steps, including 373 resets, run finished after 1390 ms. (steps per millisecond=7 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 117785 steps, run timeout after 9001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 117785 steps, saw 21335 distinct states, run finished after 9001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-21 21:57:03] [INFO ] Invariant cache hit.
[2023-03-21 21:57:03] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 21:57:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-21 21:57:28] [INFO ] After 24930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-21 21:57:28] [INFO ] After 24971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-21 21:57:28] [INFO ] After 25128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 74 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 40011/40011 transitions.
Applied a total of 0 rules in 885 ms. Remains 140 /140 variables (removed 0) and now considering 40011/40011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 885 ms. Remains : 140/140 places, 40011/40011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 40011/40011 transitions.
Applied a total of 0 rules in 849 ms. Remains 140 /140 variables (removed 0) and now considering 40011/40011 (removed 0) transitions.
[2023-03-21 21:57:30] [INFO ] Invariant cache hit.
[2023-03-21 21:57:30] [INFO ] Implicit Places using invariants in 89 ms returned []
Implicit Place search using SMT only with invariants took 90 ms to find 0 implicit places.
[2023-03-21 21:57:30] [INFO ] Invariant cache hit.
[2023-03-21 21:57:51] [INFO ] Dead Transitions using invariants and state equation in 20197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21153 ms. Remains : 140/140 places, 40011/40011 transitions.
Applied a total of 0 rules in 857 ms. Remains 140 /140 variables (removed 0) and now considering 40011/40011 (removed 0) transitions.
Running SMT prover for 11 properties.
[2023-03-21 21:57:52] [INFO ] Invariant cache hit.
[2023-03-21 21:57:52] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 21:57:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-21 21:58:21] [INFO ] After 29250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-21 21:58:39] [INFO ] After 47399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 10507 ms.
[2023-03-21 21:58:50] [INFO ] After 58068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 21:58:54] [INFO ] Flatten gal took : 4021 ms
[2023-03-21 21:58:54] [INFO ] Applying decomposition
[2023-03-21 21:58:58] [INFO ] Flatten gal took : 3921 ms
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :13 after 20
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :20 after 35
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :35 after 346
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :346 after 5495
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :5495 after 370183
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6598883260320454457.txt' '-o' '/tmp/graph6598883260320454457.bin' '-w' '/tmp/graph6598883260320454457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6598883260320454457.bin' '-l' '-1' '-v' '-w' '/tmp/graph6598883260320454457.weights' '-q' '0' '-e' '0.001'
[2023-03-21 21:59:13] [INFO ] Decomposing Gal with order
[2023-03-21 21:59:13] [INFO ] Rewriting arrays to variables to allow decomposition.
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :370183 after 539333
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :539333 after 541616
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :541616 after 1.13085e+06
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :1.13085e+06 after 1.48789e+06
[2023-03-21 21:59:25] [INFO ] Removed a total of 359077 redundant transitions.
[2023-03-21 21:59:26] [INFO ] Flatten gal took : 7455 ms
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :1.48789e+06 after 3.45271e+06
[2023-03-21 21:59:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2940 ms.
[2023-03-21 21:59:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2091293241493296790.gal : 324 ms
[2023-03-21 21:59:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9194277932448295548.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2091293241493296790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9194277932448295548.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :3.45271e+06 after 2.1342e+07
Loading property file /tmp/ReachabilityCardinality9194277932448295548.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :1 after 1.34529e+17
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :2.1342e+07 after 2.61383e+09

BK_STOP 1679436222839

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="StigmergyElection-PT-09b"
export BK_EXAMINATION="ReachabilityFireability"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-09b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645800679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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