About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C11
| Execution Summary | |||||
| Max Memory Used (MB)  | 
      Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status  | 
   
| 16217.415 | 3600000.00 | 3749966.00 | 28777.00 | 1 1 1 1 ? 1 ? 1 1 1 1 1 ? 1 ? ? | normal | 
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821500869.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
 Generated by BenchKit 2-4028
    Executing tool itstools
    Input is MultiCrashLeafsetExtension-PT-S32C11, examination is UpperBounds
    Time confinement is 3600 seconds
    Memory confinement is 16384 MBytes
    Number of cores is 4
    Run identifier is r132-tall-165271821500869
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 35M
-rw-r--r-- 1 mcc users  13K Apr 29 16:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users  81K Apr 29 16:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 29 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users  52K Apr 29 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K May  9 08:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users  26K May  9 08:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May  9 08:18 LTLFireability.txt
-rw-r--r-- 1 mcc users  19K May  9 08:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May  9 08:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May  9 08:18 UpperBounds.xml
-rw-r--r-- 1 mcc users    6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users    7 May 10 09:34 instance
-rw-r--r-- 1 mcc users    6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users  35M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652893416862
Running Version 202205111006
[2022-05-18 17:03:38] [INFO   ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600] 
[2022-05-18 17:03:38] [INFO   ] Parsing pnml file : /home/mcc/execution/model.pnml 
[2022-05-18 17:03:39] [INFO   ] Load time of PNML (sax parser for PT used): 1200 ms 
[2022-05-18 17:03:39] [INFO   ] Transformed 34406 places. 
[2022-05-18 17:03:39] [INFO   ] Transformed 51525 transitions. 
[2022-05-18 17:03:39] [INFO   ] Parsed PT model containing 34406 places and 51525 transitions in 1517 ms. 
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Normalized transition count is 50469 out of 51525 initially.
// Phase 1: matrix 50469 rows 34406 cols
[2022-05-18 17:03:49] [INFO   ] Computed 1963 place invariants in 8934 ms 
Incomplete random walk after 10000  steps, including 88 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001  steps, including 13 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 16) seen :1
[2022-05-18 17:03:51] [INFO   ] Flow matrix only has 50469 transitions (discarded 1056 similar events) 
// Phase 1: matrix 50469 rows 34406 cols
[2022-05-18 17:04:00] [INFO   ] Computed 1963 place invariants in 8684 ms 
[2022-05-18 17:04:25] [INFO   ] [Real]Absence check using  92 positive place invariants in 82 ms returned unknown 
[2022-05-18 17:04:35] [INFO   ] [Real]Absence check using  92 positive place invariants in 74 ms returned unknown 
[2022-05-18 17:04:45] [INFO   ] [Real]Absence check using  92 positive place invariants in 70 ms returned unknown 
[2022-05-18 17:04:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9 
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:242)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2342)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
	at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
	at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
	at fr.lip6.move.gal.application.Application.start(Application.java:174)
	at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
	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:401)
	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:62)
	at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
	at java.base/java.lang.reflect.Method.invoke(Method.java:566)
	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)
Current structural bounds on expressions (after SMT) : [99, 33, 99, 33, 99, 33, 1, 33, 99, 99, 33, 33, 1, 33, 33, 33] Max seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0]
Support contains 16 out of 34406 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 34406/34406 places, 51525/51525 transitions.
Graph (complete) has 112391 edges and 34406 vertex of which 34348 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.82 ms
Discarding 58 places :
Also discarding 0 output transitions 
Drop transitions removed 11602 transitions 
Trivial Post-agglo rules discarded 11602 transitions
Performed 11602 trivial Post agglomeration. Transition count delta: 11602
Iterating post reduction 0 with 11602 rules applied. Total rules applied 11603 place count 34348 transition count 39923
Reduce places removed 11602 places and 0 transitions. 
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11607 rules applied. Total rules applied 23210 place count 22746 transition count 39918
Reduce places removed 5 places and 0 transitions. 
Iterating post reduction 2 with 5 rules applied. Total rules applied 23215 place count 22741 transition count 39918
Performed 726 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 726 Pre rules applied. Total rules applied 23215 place count 22741 transition count 39192
Deduced a syphon composed of 726 places in 98 ms
Reduce places removed 726 places and 0 transitions. 
Iterating global reduction 3 with 1452 rules applied. Total rules applied 24667 place count 22015 transition count 39192
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 136 ms
Reduce places removed 33 places and 0 transitions. 
Iterating global reduction 3 with 66 rules applied. Total rules applied 24733 place count 21982 transition count 39159
Free-agglomeration rule (complex) applied 1577 times.
Iterating global reduction 3 with 1577 rules applied. Total rules applied 26310 place count 21982 transition count 37582
Reduce places removed 1577 places and 0 transitions. 
Iterating post reduction 3 with 1577 rules applied. Total rules applied 27887 place count 20405 transition count 37582
Partial Free-agglomeration rule applied 5794 times.
Drop transitions removed 5794 transitions 
Iterating global reduction 4 with 5794 rules applied. Total rules applied 33681 place count 20405 transition count 37582
Applied a total of 33681 rules in 16729 ms. Remains 20405 /34406 variables (removed 14001) and now considering 37582/51525 (removed 13943) transitions.
Finished structural reductions, in 1 iterations. Remains : 20405/34406 places, 37582/51525 transitions.
Normalized transition count is 36016 out of 37582 initially.
// Phase 1: matrix 36016 rows 20405 cols
[2022-05-18 17:05:54] [INFO   ] Computed 1905 place invariants in 16590 ms 
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 257257  steps, including 3810 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 8
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 369558  steps, including 549 resets, run timeout after 5001 ms. (steps per millisecond=73 ) properties seen 3
Interrupted Best-First random walk after 382861  steps, including 569 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 1
Interrupted Best-First random walk after 386721  steps, including 575 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 2
Interrupted Best-First random walk after 380954  steps, including 566 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 1
Interrupted Best-First random walk after 383660  steps, including 570 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 1
Interrupted Best-First random walk after 384211  steps, including 571 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 1
Interrupted Best-First random walk after 385506  steps, including 573 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 2
Interrupted Best-First random walk after 385586  steps, including 573 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 1
Interrupted Best-First random walk after 390549  steps, including 580 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
[2022-05-18 17:07:09] [INFO   ] Flow matrix only has 36016 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36016 rows 20405 cols
[2022-05-18 17:07:25] [INFO   ] Computed 1905 place invariants in 16056 ms 
[2022-05-18 17:07:28] [INFO   ] [Real]Absence check using  65 positive place invariants in 893 ms returned sat 
[2022-05-18 17:07:28] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 61 ms returned unsat 
[2022-05-18 17:07:31] [INFO   ] [Real]Absence check using  65 positive place invariants in 871 ms returned sat 
[2022-05-18 17:07:33] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1790 ms returned unsat 
[2022-05-18 17:07:36] [INFO   ] [Real]Absence check using  65 positive place invariants in 806 ms returned sat 
[2022-05-18 17:07:37] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1545 ms returned sat 
[2022-05-18 17:07:37] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:08:18] [INFO   ] [Real]Absence check using state equation in 40491 ms returned unknown 
[2022-05-18 17:08:21] [INFO   ] [Real]Absence check using  65 positive place invariants in 913 ms returned sat 
[2022-05-18 17:08:23] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1971 ms returned sat 
[2022-05-18 17:08:23] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:09:03] [INFO   ] [Real]Absence check using state equation in 39726 ms returned unknown 
[2022-05-18 17:09:06] [INFO   ] [Real]Absence check using  65 positive place invariants in 803 ms returned sat 
[2022-05-18 17:09:06] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 272 ms returned unsat 
[2022-05-18 17:09:09] [INFO   ] [Real]Absence check using  65 positive place invariants in 849 ms returned sat 
[2022-05-18 17:09:09] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 63 ms returned unsat 
[2022-05-18 17:09:12] [INFO   ] [Real]Absence check using  65 positive place invariants in 815 ms returned sat 
[2022-05-18 17:09:14] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1446 ms returned sat 
[2022-05-18 17:09:14] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:09:54] [INFO   ] [Real]Absence check using state equation in 40371 ms returned unknown 
[2022-05-18 17:09:57] [INFO   ] [Real]Absence check using  65 positive place invariants in 825 ms returned sat 
[2022-05-18 17:09:59] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1751 ms returned sat 
[2022-05-18 17:09:59] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:10:39] [INFO   ] [Real]Absence check using state equation in 40061 ms returned unknown 
[2022-05-18 17:10:42] [INFO   ] [Real]Absence check using  65 positive place invariants in 893 ms returned sat 
[2022-05-18 17:10:44] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1957 ms returned sat 
[2022-05-18 17:10:44] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:11:24] [INFO   ] [Real]Absence check using state equation in 39910 ms returned unknown 
Current structural bounds on expressions (after SMT) : [1, 1, 2, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 0, 0, 1, 1, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 20405 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20405/20405 places, 37582/37582 transitions.
Drop transitions removed 7 transitions 
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20405 transition count 37575
Reduce places removed 7 places and 0 transitions. 
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 20398 transition count 37575
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 20398 transition count 37567
Reduce places removed 8 places and 0 transitions. 
Iterating post reduction 2 with 8 rules applied. Total rules applied 30 place count 20390 transition count 37567
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions 
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 20390 transition count 37567
Applied a total of 31 rules in 4417 ms. Remains 20390 /20405 variables (removed 15) and now considering 37567/37582 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 20390/20405 places, 37567/37582 transitions.
Normalized transition count is 36001 out of 37567 initially.
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:11:44] [INFO   ] Computed 1905 place invariants in 14813 ms 
Interrupted random walk after 244932  steps, including 3629 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 346580  steps, including 515 resets, run timeout after 5001 ms. (steps per millisecond=69 ) properties seen 0
Interrupted Best-First random walk after 330071  steps, including 490 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 279534  steps, including 415 resets, run timeout after 5001 ms. (steps per millisecond=55 ) properties seen 0
Interrupted Best-First random walk after 252986  steps, including 376 resets, run timeout after 5001 ms. (steps per millisecond=50 ) properties seen 0
Interrupted Best-First random walk after 262119  steps, including 389 resets, run timeout after 5001 ms. (steps per millisecond=52 ) properties seen 0
[2022-05-18 17:12:39] [INFO   ] Flow matrix only has 36001 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:12:58] [INFO   ] Computed 1905 place invariants in 19256 ms 
[2022-05-18 17:13:01] [INFO   ] [Real]Absence check using  65 positive place invariants in 792 ms returned sat 
[2022-05-18 17:13:03] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1851 ms returned sat 
[2022-05-18 17:13:03] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:13:43] [INFO   ] [Real]Absence check using state equation in 40016 ms returned unknown 
[2022-05-18 17:13:46] [INFO   ] [Real]Absence check using  65 positive place invariants in 762 ms returned sat 
[2022-05-18 17:13:48] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1907 ms returned sat 
[2022-05-18 17:13:48] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:14:28] [INFO   ] [Real]Absence check using state equation in 39998 ms returned unknown 
[2022-05-18 17:14:31] [INFO   ] [Real]Absence check using  65 positive place invariants in 753 ms returned sat 
[2022-05-18 17:14:33] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1846 ms returned sat 
[2022-05-18 17:14:33] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:15:13] [INFO   ] [Real]Absence check using state equation in 40183 ms returned unknown 
[2022-05-18 17:15:16] [INFO   ] [Real]Absence check using  65 positive place invariants in 770 ms returned sat 
[2022-05-18 17:15:18] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1875 ms returned sat 
[2022-05-18 17:15:18] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:15:58] [INFO   ] [Real]Absence check using state equation in 40090 ms returned unknown 
[2022-05-18 17:16:01] [INFO   ] [Real]Absence check using  65 positive place invariants in 754 ms returned sat 
[2022-05-18 17:16:03] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1729 ms returned sat 
[2022-05-18 17:16:03] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:16:43] [INFO   ] [Real]Absence check using state equation in 40309 ms returned unknown 
Current structural bounds on expressions (after SMT) : [2, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 20390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20390/20390 places, 37567/37567 transitions.
Applied a total of 0 rules in 1471 ms. Remains 20390 /20390 variables (removed 0) and now considering 37567/37567 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20390/20390 places, 37567/37567 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20390/20390 places, 37567/37567 transitions.
Applied a total of 0 rules in 1469 ms. Remains 20390 /20390 variables (removed 0) and now considering 37567/37567 (removed 0) transitions.
[2022-05-18 17:16:46] [INFO   ] Flow matrix only has 36001 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:17:06] [INFO   ] Computed 1905 place invariants in 20493 ms 
[2022-05-18 17:17:08] [INFO   ] Implicit Places using invariants in 22407 ms returned [] 
Implicit Place search using SMT only with invariants took 22408 ms to find 0 implicit places.
[2022-05-18 17:17:08] [INFO   ] Flow matrix only has 36001 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:17:26] [INFO   ] Computed 1905 place invariants in 17606 ms 
[2022-05-18 17:17:28] [INFO   ] Dead Transitions using invariants and state equation in 19269 ms found 0 transitions. 
Finished structural reductions, in 1 iterations. Remains : 20390/20390 places, 37567/37567 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-04
Normalized transition count is 36001 out of 37567 initially.
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:17:44] [INFO   ] Computed 1905 place invariants in 16613 ms 
Incomplete random walk after 10000  steps, including 148 resets, run finished after 1252 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001  steps, including 14 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
[2022-05-18 17:17:46] [INFO   ] Flow matrix only has 36001 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:18:00] [INFO   ] Computed 1905 place invariants in 13918 ms 
[2022-05-18 17:18:03] [INFO   ] [Real]Absence check using  65 positive place invariants in 737 ms returned sat 
[2022-05-18 17:18:04] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1233 ms returned sat 
[2022-05-18 17:18:04] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:18:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0 
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
	at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
	at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
	at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
	at fr.lip6.move.gal.application.Application.start(Application.java:174)
	at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
	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:401)
	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:62)
	at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
	at java.base/java.lang.reflect.Method.invoke(Method.java:566)
	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)
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 20390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20390/20390 places, 37567/37567 transitions.
Drop transitions removed 2 transitions 
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20390 transition count 37565
Reduce places removed 2 places and 0 transitions. 
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20388 transition count 37565
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 20388 transition count 37563
Reduce places removed 2 places and 0 transitions. 
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 20386 transition count 37563
Applied a total of 8 rules in 2967 ms. Remains 20386 /20390 variables (removed 4) and now considering 37563/37567 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 20386/20390 places, 37563/37567 transitions.
Normalized transition count is 35997 out of 37563 initially.
// Phase 1: matrix 35997 rows 20386 cols
[2022-05-18 17:18:26] [INFO   ] Computed 1905 place invariants in 18745 ms 
Interrupted random walk after 245620  steps, including 3640 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 336994  steps, including 501 resets, run timeout after 5001 ms. (steps per millisecond=67 ) properties seen 0
[2022-05-18 17:19:02] [INFO   ] Flow matrix only has 35997 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35997 rows 20386 cols
[2022-05-18 17:19:18] [INFO   ] Computed 1905 place invariants in 16737 ms 
[2022-05-18 17:19:21] [INFO   ] [Real]Absence check using  65 positive place invariants in 822 ms returned sat 
[2022-05-18 17:19:23] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1725 ms returned sat 
[2022-05-18 17:19:23] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:20:03] [INFO   ] [Real]Absence check using state equation in 40303 ms returned unknown 
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 20386 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1346 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20386/20386 places, 37563/37563 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1353 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
[2022-05-18 17:20:06] [INFO   ] Flow matrix only has 35997 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35997 rows 20386 cols
[2022-05-18 17:20:22] [INFO   ] Computed 1905 place invariants in 16232 ms 
[2022-05-18 17:20:24] [INFO   ] Implicit Places using invariants in 17920 ms returned [] 
Implicit Place search using SMT only with invariants took 17921 ms to find 0 implicit places.
[2022-05-18 17:20:24] [INFO   ] Flow matrix only has 35997 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35997 rows 20386 cols
[2022-05-18 17:20:41] [INFO   ] Computed 1905 place invariants in 17450 ms 
[2022-05-18 17:20:43] [INFO   ] Dead Transitions using invariants and state equation in 19295 ms found 0 transitions. 
Finished structural reductions, in 1 iterations. Remains : 20386/20386 places, 37563/37563 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-04 in 195575 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-06
Normalized transition count is 36001 out of 37567 initially.
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:21:01] [INFO   ] Computed 1905 place invariants in 17875 ms 
Incomplete random walk after 10000  steps, including 148 resets, run finished after 1132 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001  steps, including 14 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
[2022-05-18 17:21:02] [INFO   ] Flow matrix only has 36001 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:21:21] [INFO   ] Computed 1905 place invariants in 18622 ms 
[2022-05-18 17:21:24] [INFO   ] [Real]Absence check using  65 positive place invariants in 783 ms returned sat 
[2022-05-18 17:21:26] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1433 ms returned sat 
[2022-05-18 17:21:26] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:21:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0 
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
	at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
	at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
	at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
	at fr.lip6.move.gal.application.Application.start(Application.java:174)
	at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
	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:401)
	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:62)
	at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
	at java.base/java.lang.reflect.Method.invoke(Method.java:566)
	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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20390/20390 places, 37567/37567 transitions.
Drop transitions removed 2 transitions 
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20390 transition count 37565
Reduce places removed 2 places and 0 transitions. 
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20388 transition count 37565
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 20388 transition count 37562
Reduce places removed 3 places and 0 transitions. 
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 20385 transition count 37562
Applied a total of 10 rules in 3210 ms. Remains 20385 /20390 variables (removed 5) and now considering 37562/37567 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 20385/20390 places, 37562/37567 transitions.
Normalized transition count is 35996 out of 37562 initially.
// Phase 1: matrix 35996 rows 20385 cols
[2022-05-18 17:21:48] [INFO   ] Computed 1905 place invariants in 18578 ms 
Interrupted random walk after 238195  steps, including 3529 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Interrupted Best-First random walk after 358606  steps, including 533 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen 0
[2022-05-18 17:22:23] [INFO   ] Flow matrix only has 35996 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35996 rows 20385 cols
[2022-05-18 17:22:39] [INFO   ] Computed 1905 place invariants in 16114 ms 
[2022-05-18 17:22:42] [INFO   ] [Real]Absence check using  65 positive place invariants in 818 ms returned sat 
[2022-05-18 17:22:44] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1543 ms returned sat 
[2022-05-18 17:22:44] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:23:24] [INFO   ] [Real]Absence check using state equation in 40222 ms returned unknown 
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20385 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1427 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20385/20385 places, 37562/37562 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1416 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
[2022-05-18 17:23:27] [INFO   ] Flow matrix only has 35996 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35996 rows 20385 cols
[2022-05-18 17:23:41] [INFO   ] Computed 1905 place invariants in 13635 ms 
[2022-05-18 17:23:42] [INFO   ] Implicit Places using invariants in 15453 ms returned [] 
Implicit Place search using SMT only with invariants took 15454 ms to find 0 implicit places.
[2022-05-18 17:23:42] [INFO   ] Flow matrix only has 35996 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35996 rows 20385 cols
[2022-05-18 17:24:00] [INFO   ] Computed 1905 place invariants in 17681 ms 
[2022-05-18 17:24:02] [INFO   ] Dead Transitions using invariants and state equation in 19469 ms found 0 transitions. 
Finished structural reductions, in 1 iterations. Remains : 20385/20385 places, 37562/37562 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-06 in 198728 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-12
Normalized transition count is 36001 out of 37567 initially.
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:24:16] [INFO   ] Computed 1905 place invariants in 14219 ms 
Incomplete random walk after 10000  steps, including 148 resets, run finished after 1216 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001  steps, including 14 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
[2022-05-18 17:24:18] [INFO   ] Flow matrix only has 36001 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:24:31] [INFO   ] Computed 1905 place invariants in 12931 ms 
[2022-05-18 17:24:34] [INFO   ] [Real]Absence check using  65 positive place invariants in 779 ms returned sat 
[2022-05-18 17:24:35] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1435 ms returned sat 
[2022-05-18 17:24:35] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:24:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0 
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
	at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
	at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
	at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
	at fr.lip6.move.gal.application.Application.start(Application.java:174)
	at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
	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:401)
	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:62)
	at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
	at java.base/java.lang.reflect.Method.invoke(Method.java:566)
	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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20390/20390 places, 37567/37567 transitions.
Drop transitions removed 2 transitions 
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20390 transition count 37565
Reduce places removed 2 places and 0 transitions. 
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 20388 transition count 37565
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 20388 transition count 37562
Reduce places removed 3 places and 0 transitions. 
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 20385 transition count 37562
Applied a total of 10 rules in 2839 ms. Remains 20385 /20390 variables (removed 5) and now considering 37562/37567 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 20385/20390 places, 37562/37567 transitions.
Normalized transition count is 35996 out of 37562 initially.
// Phase 1: matrix 35996 rows 20385 cols
[2022-05-18 17:24:52] [INFO   ] Computed 1905 place invariants in 13634 ms 
Interrupted random walk after 259676  steps, including 3848 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 402469  steps, including 598 resets, run timeout after 5001 ms. (steps per millisecond=80 ) properties seen 0
[2022-05-18 17:25:27] [INFO   ] Flow matrix only has 35996 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35996 rows 20385 cols
[2022-05-18 17:25:41] [INFO   ] Computed 1905 place invariants in 13600 ms 
[2022-05-18 17:25:44] [INFO   ] [Real]Absence check using  65 positive place invariants in 766 ms returned sat 
[2022-05-18 17:25:45] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1495 ms returned sat 
[2022-05-18 17:25:45] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:26:26] [INFO   ] [Real]Absence check using state equation in 40427 ms returned unknown 
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20385 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1341 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20385/20385 places, 37562/37562 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1456 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
[2022-05-18 17:26:29] [INFO   ] Flow matrix only has 35996 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35996 rows 20385 cols
[2022-05-18 17:26:41] [INFO   ] Computed 1905 place invariants in 12777 ms 
[2022-05-18 17:26:43] [INFO   ] Implicit Places using invariants in 14657 ms returned [] 
Implicit Place search using SMT only with invariants took 14658 ms to find 0 implicit places.
[2022-05-18 17:26:43] [INFO   ] Flow matrix only has 35996 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35996 rows 20385 cols
[2022-05-18 17:27:00] [INFO   ] Computed 1905 place invariants in 16721 ms 
[2022-05-18 17:27:02] [INFO   ] Dead Transitions using invariants and state equation in 18373 ms found 0 transitions. 
Finished structural reductions, in 1 iterations. Remains : 20385/20385 places, 37562/37562 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-12 in 179674 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-14
Normalized transition count is 36001 out of 37567 initially.
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:27:16] [INFO   ] Computed 1905 place invariants in 13823 ms 
Incomplete random walk after 10000  steps, including 148 resets, run finished after 1161 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001  steps, including 14 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
[2022-05-18 17:27:17] [INFO   ] Flow matrix only has 36001 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:27:31] [INFO   ] Computed 1905 place invariants in 14441 ms 
[2022-05-18 17:27:34] [INFO   ] [Real]Absence check using  65 positive place invariants in 796 ms returned sat 
[2022-05-18 17:27:36] [INFO   ] SMT solver returned unknown. Retrying; 
[2022-05-18 17:27:36] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1807 ms returned unknown 
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20390/20390 places, 37567/37567 transitions.
Drop transitions removed 1 transitions 
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20390 transition count 37566
Reduce places removed 1 places and 0 transitions. 
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20389 transition count 37566
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 20389 transition count 37564
Reduce places removed 2 places and 0 transitions. 
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 20387 transition count 37564
Applied a total of 6 rules in 2855 ms. Remains 20387 /20390 variables (removed 3) and now considering 37564/37567 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 20387/20390 places, 37564/37567 transitions.
Normalized transition count is 35998 out of 37564 initially.
// Phase 1: matrix 35998 rows 20387 cols
[2022-05-18 17:27:54] [INFO   ] Computed 1905 place invariants in 14864 ms 
Interrupted random walk after 260920  steps, including 3865 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 391304  steps, including 581 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
[2022-05-18 17:28:29] [INFO   ] Flow matrix only has 35998 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35998 rows 20387 cols
[2022-05-18 17:28:42] [INFO   ] Computed 1905 place invariants in 12824 ms 
[2022-05-18 17:28:45] [INFO   ] [Real]Absence check using  65 positive place invariants in 731 ms returned sat 
[2022-05-18 17:28:46] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1094 ms returned sat 
[2022-05-18 17:28:46] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:29:27] [INFO   ] [Real]Absence check using state equation in 41059 ms returned unknown 
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20387 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20387/20387 places, 37564/37564 transitions.
Applied a total of 0 rules in 1304 ms. Remains 20387 /20387 variables (removed 0) and now considering 37564/37564 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20387/20387 places, 37564/37564 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20387/20387 places, 37564/37564 transitions.
Applied a total of 0 rules in 1295 ms. Remains 20387 /20387 variables (removed 0) and now considering 37564/37564 (removed 0) transitions.
[2022-05-18 17:29:30] [INFO   ] Flow matrix only has 35998 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35998 rows 20387 cols
[2022-05-18 17:29:43] [INFO   ] Computed 1905 place invariants in 13090 ms 
[2022-05-18 17:29:44] [INFO   ] Implicit Places using invariants in 14682 ms returned [] 
Implicit Place search using SMT only with invariants took 14686 ms to find 0 implicit places.
[2022-05-18 17:29:44] [INFO   ] Flow matrix only has 35998 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35998 rows 20387 cols
[2022-05-18 17:30:00] [INFO   ] Computed 1905 place invariants in 15997 ms 
[2022-05-18 17:30:02] [INFO   ] Dead Transitions using invariants and state equation in 17824 ms found 0 transitions. 
Finished structural reductions, in 1 iterations. Remains : 20387/20387 places, 37564/37564 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-14 in 180460 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-15
Normalized transition count is 36001 out of 37567 initially.
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:30:15] [INFO   ] Computed 1905 place invariants in 12471 ms 
Incomplete random walk after 10000  steps, including 148 resets, run finished after 1153 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001  steps, including 14 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
[2022-05-18 17:30:16] [INFO   ] Flow matrix only has 36001 transitions (discarded 1566 similar events) 
// Phase 1: matrix 36001 rows 20390 cols
[2022-05-18 17:30:29] [INFO   ] Computed 1905 place invariants in 13127 ms 
[2022-05-18 17:30:32] [INFO   ] [Real]Absence check using  65 positive place invariants in 753 ms returned sat 
[2022-05-18 17:30:33] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 1185 ms returned sat 
[2022-05-18 17:30:33] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:30:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0 
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
	at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
	at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
	at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
	at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
	at fr.lip6.move.gal.application.Application.start(Application.java:174)
	at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
	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:401)
	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:62)
	at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
	at java.base/java.lang.reflect.Method.invoke(Method.java:566)
	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)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20390/20390 places, 37567/37567 transitions.
Drop transitions removed 1 transitions 
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20390 transition count 37566
Reduce places removed 1 places and 0 transitions. 
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20389 transition count 37566
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 20389 transition count 37564
Reduce places removed 2 places and 0 transitions. 
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 20387 transition count 37564
Applied a total of 6 rules in 3236 ms. Remains 20387 /20390 variables (removed 3) and now considering 37564/37567 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 20387/20390 places, 37564/37567 transitions.
Normalized transition count is 35998 out of 37564 initially.
// Phase 1: matrix 35998 rows 20387 cols
[2022-05-18 17:30:59] [INFO   ] Computed 1905 place invariants in 21548 ms 
Interrupted random walk after 222553  steps, including 3297 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Interrupted Best-First random walk after 324259  steps, including 482 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
[2022-05-18 17:31:34] [INFO   ] Flow matrix only has 35998 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35998 rows 20387 cols
[2022-05-18 17:31:57] [INFO   ] Computed 1905 place invariants in 23258 ms 
[2022-05-18 17:32:01] [INFO   ] [Real]Absence check using  65 positive place invariants in 871 ms returned sat 
[2022-05-18 17:32:03] [INFO   ] [Real]Absence check using  65 positive and 1840 generalized place invariants in 2083 ms returned sat 
[2022-05-18 17:32:03] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-18 17:32:42] [INFO   ] [Real]Absence check using state equation in 39599 ms returned unknown 
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20387 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20387/20387 places, 37564/37564 transitions.
Applied a total of 0 rules in 1422 ms. Remains 20387 /20387 variables (removed 0) and now considering 37564/37564 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 20387/20387 places, 37564/37564 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 20387/20387 places, 37564/37564 transitions.
Applied a total of 0 rules in 1444 ms. Remains 20387 /20387 variables (removed 0) and now considering 37564/37564 (removed 0) transitions.
[2022-05-18 17:32:45] [INFO   ] Flow matrix only has 35998 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35998 rows 20387 cols
[2022-05-18 17:33:09] [INFO   ] Computed 1905 place invariants in 23666 ms 
[2022-05-18 17:33:11] [INFO   ] Implicit Places using invariants in 25404 ms returned [] 
Implicit Place search using SMT only with invariants took 25412 ms to find 0 implicit places.
[2022-05-18 17:33:11] [INFO   ] Flow matrix only has 35998 transitions (discarded 1566 similar events) 
// Phase 1: matrix 35998 rows 20387 cols
[2022-05-18 17:33:32] [INFO   ] Computed 1905 place invariants in 21399 ms 
[2022-05-18 17:33:34] [INFO   ] Dead Transitions using invariants and state equation in 23087 ms found 0 transitions. 
Finished structural reductions, in 1 iterations. Remains : 20387/20387 places, 37564/37564 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-15 in 211656 ms.
[2022-05-18 17:33:37] [INFO   ] Flatten gal took : 2762 ms 
[2022-05-18 17:33:39] [INFO   ] Applying decomposition  
[2022-05-18 17:33:42] [INFO   ] Flatten gal took : 2197 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/graph7422410865651065867.txt' '-o' '/tmp/graph7422410865651065867.bin' '-w' '/tmp/graph7422410865651065867.weights' 
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7422410865651065867.bin' '-l' '-1' '-v' '-w' '/tmp/graph7422410865651065867.weights' '-q' '0' '-e' '0.001' 
[2022-05-18 17:33:47] [INFO   ] Decomposing Gal with order  
[2022-05-18 17:33:49] [INFO   ] Rewriting arrays  to variables to allow decomposition. 
[2022-05-18 17:34:34] [INFO   ] Removed a total of 66792 redundant transitions. 
[2022-05-18 17:34:41] [INFO   ] Flatten gal took : 46000 ms 
[2022-05-18 17:35:20] [INFO   ] Fuse similar labels procedure discarded/fused a total of 38739 labels/synchronizations in 19291 ms. 
[2022-05-18 17:35:20] [INFO   ] Time to serialize gal into /tmp/UpperBounds14243538328414315196.gal : 669 ms 
[2022-05-18 17:35:20] [INFO   ] Time to serialize properties into /tmp/UpperBounds17996108236237917226.prop : 0 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14243538328414315196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17996108236237917226.prop' '--nowitness' 
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64  --gc-threshold  2000000  --quiet  -i  /tmp...276
Loading property file /tmp/UpperBounds17996108236237917226.prop.
ITS-tools command line returned an error code 137
[2022-05-18 17:54:51] [INFO   ] Flatten gal took : 8461 ms 
[2022-05-18 17:54:55] [INFO   ] Time to serialize gal into /tmp/UpperBounds5259767481857670301.gal : 3961 ms 
[2022-05-18 17:54:55] [INFO   ] Time to serialize properties into /tmp/UpperBounds17230143792534623152.prop : 0 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5259767481857670301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17230143792534623152.prop' '--nowitness' '--gen-order' 'FOLLOW' 
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64  --gc-threshold  2000000  --quiet  -i  /tmp...296
Loading property file /tmp/UpperBounds17230143792534623152.prop.
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C11"
export BK_EXAMINATION="UpperBounds"
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 MultiCrashLeafsetExtension-PT-S32C11, examination is UpperBounds"
echo "    Time confinement is $BK_TIME_CONFINEMENT seconds"
echo "    Memory confinement is 16384 MBytes"
echo "    Number of cores is 4"
echo "    Run identifier is r132-tall-165271821500869"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C11.tgz
mv MultiCrashLeafsetExtension-PT-S32C11 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
	echo "The expected result is a vector of positive values"
	echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
	echo "here is the order used to build the result vector(from text file)"
	for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
		echo "FORMULA_NAME $x"
	done
elif [ -f "UpperBounds.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 '
		echo "FORMULA_NAME $x"
	done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
	echo "FORMULA_NAME UpperBounds"
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 ;
