./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2023-11-26 11:51:59,981 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-26 11:52:00,081 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-26 11:52:00,087 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-11-26 11:52:00,088 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-26 11:52:00,112 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-26 11:52:00,113 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-26 11:52:00,113 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-26 11:52:00,114 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-26 11:52:00,115 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2023-11-26 11:52:00,116 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-26 11:52:00,116 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-26 11:52:00,117 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-26 11:52:00,118 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-26 11:52:00,119 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-26 11:52:00,119 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-26 11:52:00,120 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-26 11:52:00,121 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-26 11:52:00,121 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-26 11:52:00,122 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-26 11:52:00,122 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-26 11:52:00,123 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-26 11:52:00,124 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-26 11:52:00,124 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-26 11:52:00,125 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-26 11:52:00,125 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-26 11:52:00,126 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-26 11:52:00,126 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-26 11:52:00,127 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-26 11:52:00,127 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2023-11-26 11:52:00,128 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-26 11:52:00,128 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 11:52:00,129 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-26 11:52:00,129 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-26 11:52:00,129 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-26 11:52:00,130 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-26 11:52:00,130 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-26 11:52:00,130 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-26 11:52:00,131 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-26 11:52:00,131 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-26 11:52:00,131 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-26 11:52:00,132 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-26 11:52:00,132 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203
[2023-11-26 11:52:00,516 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-26 11:52:00,547 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-26 11:52:00,550 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-26 11:52:00,552 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-26 11:52:00,552 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-26 11:52:00,554 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i
[2023-11-26 11:52:03,699 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-26 11:52:04,099 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-26 11:52:04,101 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i
[2023-11-26 11:52:04,126 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/data/039c1a288/a263a666f54248dc8dec2e4269add05b/FLAG2eeb76459
[2023-11-26 11:52:04,142 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/data/039c1a288/a263a666f54248dc8dec2e4269add05b
[2023-11-26 11:52:04,145 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-26 11:52:04,147 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-26 11:52:04,148 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-26 11:52:04,149 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-26 11:52:04,154 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-26 11:52:04,155 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:04,156 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d05d865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04, skipping insertion in model container
[2023-11-26 11:52:04,157 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:04,206 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-26 11:52:04,394 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969]
[2023-11-26 11:52:04,646 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-26 11:52:04,667 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-26 11:52:04,685 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969]
[2023-11-26 11:52:04,768 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-26 11:52:04,804 WARN  L675               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-26 11:52:04,805 WARN  L675               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-26 11:52:04,813 INFO  L206         MainTranslator]: Completed translation
[2023-11-26 11:52:04,814 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04 WrapperNode
[2023-11-26 11:52:04,814 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-26 11:52:04,815 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-26 11:52:04,815 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-26 11:52:04,816 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-26 11:52:04,824 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:04,878 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:04,934 INFO  L138                Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152
[2023-11-26 11:52:04,935 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-26 11:52:04,935 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-26 11:52:04,936 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-26 11:52:04,936 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-26 11:52:04,948 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:04,949 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:04,963 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:04,986 INFO  L175           MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1].
[2023-11-26 11:52:04,996 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:04,996 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:05,005 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:05,020 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:05,023 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:05,031 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:05,035 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-26 11:52:05,036 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-26 11:52:05,036 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-26 11:52:05,036 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-26 11:52:05,037 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (1/1) ...
[2023-11-26 11:52:05,049 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2023-11-26 11:52:05,063 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/z3
[2023-11-26 11:52:05,080 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2023-11-26 11:52:05,117 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2023-11-26 11:52:05,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2023-11-26 11:52:05,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2023-11-26 11:52:05,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2023-11-26 11:52:05,134 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2023-11-26 11:52:05,134 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#4
[2023-11-26 11:52:05,136 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-26 11:52:05,136 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-26 11:52:05,137 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-26 11:52:05,137 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-26 11:52:05,137 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-11-26 11:52:05,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-11-26 11:52:05,138 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-11-26 11:52:05,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-11-26 11:52:05,138 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-11-26 11:52:05,138 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-11-26 11:52:05,139 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2023-11-26 11:52:05,140 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2023-11-26 11:52:05,140 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-11-26 11:52:05,141 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2023-11-26 11:52:05,141 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2023-11-26 11:52:05,142 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2023-11-26 11:52:05,142 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#4
[2023-11-26 11:52:05,142 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-26 11:52:05,143 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-26 11:52:05,144 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-26 11:52:05,145 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-26 11:52:05,349 INFO  L241             CfgBuilder]: Building ICFG
[2023-11-26 11:52:05,352 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-26 11:52:05,796 INFO  L282             CfgBuilder]: Performing block encoding
[2023-11-26 11:52:06,033 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-26 11:52:06,033 INFO  L309             CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-26 11:52:06,034 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:06 BoogieIcfgContainer
[2023-11-26 11:52:06,034 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-26 11:52:06,036 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-26 11:52:06,036 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-26 11:52:06,040 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-26 11:52:06,040 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:52:04" (1/3) ...
[2023-11-26 11:52:06,041 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebe974f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:52:06, skipping insertion in model container
[2023-11-26 11:52:06,041 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:52:04" (2/3) ...
[2023-11-26 11:52:06,042 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebe974f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:52:06, skipping insertion in model container
[2023-11-26 11:52:06,042 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:06" (3/3) ...
[2023-11-26 11:52:06,043 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i
[2023-11-26 11:52:06,076 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-26 11:52:06,085 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-26 11:52:06,086 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-26 11:52:06,086 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-26 11:52:06,139 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-26 11:52:06,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow
[2023-11-26 11:52:06,214 INFO  L124   PetriNetUnfolderBase]: 1/46 cut-off events.
[2023-11-26 11:52:06,215 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 11:52:06,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. 
[2023-11-26 11:52:06,219 INFO  L82        GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow
[2023-11-26 11:52:06,223 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow
[2023-11-26 11:52:06,233 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-26 11:52:06,241 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3953322f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-26 11:52:06,241 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-26 11:52:06,253 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-26 11:52:06,254 INFO  L124   PetriNetUnfolderBase]: 0/26 cut-off events.
[2023-11-26 11:52:06,254 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 11:52:06,254 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:06,255 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:06,255 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:06,260 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:06,261 INFO  L85        PathProgramCache]: Analyzing trace with hash -908920336, now seen corresponding path program 1 times
[2023-11-26 11:52:06,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:06,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442559100]
[2023-11-26 11:52:06,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:06,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:06,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:06,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:06,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:06,835 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442559100]
[2023-11-26 11:52:06,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442559100] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:06,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:06,836 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-26 11:52:06,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738163623]
[2023-11-26 11:52:06,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:06,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-26 11:52:06,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:06,894 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-26 11:52:06,895 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-26 11:52:06,897 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 28 out of 50
[2023-11-26 11:52:06,900 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:06,900 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:06,901 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 50
[2023-11-26 11:52:06,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:07,431 INFO  L124   PetriNetUnfolderBase]: 699/1415 cut-off events.
[2023-11-26 11:52:07,431 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-26 11:52:07,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 1415 events. 699/1415 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10201 event pairs, 159 based on Foata normal form. 48/1422 useless extension candidates. Maximal degree in co-relation 2471. Up to 757 conditions per place. 
[2023-11-26 11:52:07,456 INFO  L140   encePairwiseOnDemand]: 46/50 looper letters, 25 selfloop transitions, 2 changer transitions 2/53 dead transitions.
[2023-11-26 11:52:07,456 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 176 flow
[2023-11-26 11:52:07,457 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-26 11:52:07,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-26 11:52:07,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions.
[2023-11-26 11:52:07,470 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7733333333333333
[2023-11-26 11:52:07,471 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 116 transitions.
[2023-11-26 11:52:07,472 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions.
[2023-11-26 11:52:07,473 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:07,476 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions.
[2023-11-26 11:52:07,480 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:07,486 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:07,486 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:07,488 INFO  L175             Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 116 transitions.
[2023-11-26 11:52:07,489 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 176 flow
[2023-11-26 11:52:07,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-26 11:52:07,500 INFO  L231             Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow
[2023-11-26 11:52:07,502 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43}
[2023-11-26 11:52:07,506 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places.
[2023-11-26 11:52:07,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow
[2023-11-26 11:52:07,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:07,507 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:07,507 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:07,508 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-26 11:52:07,508 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:07,509 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:07,509 INFO  L85        PathProgramCache]: Analyzing trace with hash 1080621645, now seen corresponding path program 1 times
[2023-11-26 11:52:07,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:07,510 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461867011]
[2023-11-26 11:52:07,510 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:07,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:07,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:07,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:07,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:07,948 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461867011]
[2023-11-26 11:52:07,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461867011] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:07,948 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:07,948 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-26 11:52:07,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525850773]
[2023-11-26 11:52:07,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:07,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-26 11:52:07,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:07,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 11:52:07,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-26 11:52:07,982 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50
[2023-11-26 11:52:07,983 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:07,983 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:07,983 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50
[2023-11-26 11:52:07,983 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:09,443 INFO  L124   PetriNetUnfolderBase]: 4832/7336 cut-off events.
[2023-11-26 11:52:09,445 INFO  L125   PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES.
[2023-11-26 11:52:09,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14398 conditions, 7336 events. 4832/7336 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 48891 event pairs, 2110 based on Foata normal form. 0/7144 useless extension candidates. Maximal degree in co-relation 14388. Up to 4354 conditions per place. 
[2023-11-26 11:52:09,561 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 34 selfloop transitions, 5 changer transitions 49/105 dead transitions.
[2023-11-26 11:52:09,561 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 416 flow
[2023-11-26 11:52:09,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-26 11:52:09,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-26 11:52:09,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions.
[2023-11-26 11:52:09,570 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.645
[2023-11-26 11:52:09,571 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 258 transitions.
[2023-11-26 11:52:09,571 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 258 transitions.
[2023-11-26 11:52:09,572 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:09,572 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 258 transitions.
[2023-11-26 11:52:09,574 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 32.25) internal successors, (258), 8 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:09,576 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:09,577 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:09,577 INFO  L175             Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 8 states and 258 transitions.
[2023-11-26 11:52:09,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 416 flow
[2023-11-26 11:52:09,579 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-26 11:52:09,581 INFO  L231             Difference]: Finished difference. Result has 64 places, 46 transitions, 149 flow
[2023-11-26 11:52:09,581 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=64, PETRI_TRANSITIONS=46}
[2023-11-26 11:52:09,582 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places.
[2023-11-26 11:52:09,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 149 flow
[2023-11-26 11:52:09,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:09,583 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:09,583 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:09,584 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-26 11:52:09,584 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:09,585 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:09,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 2004462258, now seen corresponding path program 1 times
[2023-11-26 11:52:09,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:09,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979701874]
[2023-11-26 11:52:09,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:09,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:09,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:09,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:09,858 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:09,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979701874]
[2023-11-26 11:52:09,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979701874] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:09,860 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:09,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-26 11:52:09,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777568614]
[2023-11-26 11:52:09,860 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:09,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-26 11:52:09,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:09,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 11:52:09,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-26 11:52:09,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50
[2023-11-26 11:52:09,873 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 149 flow. Second operand  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:09,873 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:09,873 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50
[2023-11-26 11:52:09,873 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:10,813 INFO  L124   PetriNetUnfolderBase]: 2389/4085 cut-off events.
[2023-11-26 11:52:10,814 INFO  L125   PetriNetUnfolderBase]: For 3916/4178 co-relation queries the response was YES.
[2023-11-26 11:52:10,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10634 conditions, 4085 events. 2389/4085 cut-off events. For 3916/4178 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 29507 event pairs, 808 based on Foata normal form. 130/3902 useless extension candidates. Maximal degree in co-relation 10619. Up to 1667 conditions per place. 
[2023-11-26 11:52:10,873 INFO  L140   encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 3 changer transitions 27/80 dead transitions.
[2023-11-26 11:52:10,873 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 80 transitions, 385 flow
[2023-11-26 11:52:10,874 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-26 11:52:10,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-26 11:52:10,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions.
[2023-11-26 11:52:10,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6457142857142857
[2023-11-26 11:52:10,876 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 226 transitions.
[2023-11-26 11:52:10,876 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 226 transitions.
[2023-11-26 11:52:10,876 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:10,877 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 226 transitions.
[2023-11-26 11:52:10,878 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:10,880 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:10,880 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:10,880 INFO  L175             Difference]: Start difference. First operand has 64 places, 46 transitions, 149 flow. Second operand 7 states and 226 transitions.
[2023-11-26 11:52:10,881 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 80 transitions, 385 flow
[2023-11-26 11:52:11,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 372 flow, removed 4 selfloop flow, removed 3 redundant places.
[2023-11-26 11:52:11,002 INFO  L231             Difference]: Finished difference. Result has 66 places, 46 transitions, 159 flow
[2023-11-26 11:52:11,003 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=66, PETRI_TRANSITIONS=46}
[2023-11-26 11:52:11,004 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places.
[2023-11-26 11:52:11,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 46 transitions, 159 flow
[2023-11-26 11:52:11,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:11,004 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:11,005 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:11,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-26 11:52:11,005 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:11,006 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:11,006 INFO  L85        PathProgramCache]: Analyzing trace with hash 466754416, now seen corresponding path program 1 times
[2023-11-26 11:52:11,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:11,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294791478]
[2023-11-26 11:52:11,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:11,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:11,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:11,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:11,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:11,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294791478]
[2023-11-26 11:52:11,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294791478] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:11,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:11,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-26 11:52:11,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57747851]
[2023-11-26 11:52:11,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:11,225 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-26 11:52:11,226 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:11,226 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-26 11:52:11,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-26 11:52:11,238 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2023-11-26 11:52:11,239 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 46 transitions, 159 flow. Second operand  has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:11,239 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:11,239 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2023-11-26 11:52:11,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:12,885 INFO  L124   PetriNetUnfolderBase]: 6342/9606 cut-off events.
[2023-11-26 11:52:12,886 INFO  L125   PetriNetUnfolderBase]: For 7503/8097 co-relation queries the response was YES.
[2023-11-26 11:52:12,950 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23449 conditions, 9606 events. 6342/9606 cut-off events. For 7503/8097 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 66326 event pairs, 1282 based on Foata normal form. 355/9616 useless extension candidates. Maximal degree in co-relation 23430. Up to 4688 conditions per place. 
[2023-11-26 11:52:13,017 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 45 selfloop transitions, 6 changer transitions 0/72 dead transitions.
[2023-11-26 11:52:13,017 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 331 flow
[2023-11-26 11:52:13,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-26 11:52:13,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-26 11:52:13,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions.
[2023-11-26 11:52:13,024 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.72
[2023-11-26 11:52:13,024 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 144 transitions.
[2023-11-26 11:52:13,024 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 144 transitions.
[2023-11-26 11:52:13,025 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:13,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 144 transitions.
[2023-11-26 11:52:13,025 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:13,027 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:13,028 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:13,028 INFO  L175             Difference]: Start difference. First operand has 66 places, 46 transitions, 159 flow. Second operand 4 states and 144 transitions.
[2023-11-26 11:52:13,028 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 331 flow
[2023-11-26 11:52:13,070 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 72 transitions, 317 flow, removed 4 selfloop flow, removed 6 redundant places.
[2023-11-26 11:52:13,072 INFO  L231             Difference]: Finished difference. Result has 61 places, 51 transitions, 191 flow
[2023-11-26 11:52:13,072 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=61, PETRI_TRANSITIONS=51}
[2023-11-26 11:52:13,074 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places.
[2023-11-26 11:52:13,075 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 191 flow
[2023-11-26 11:52:13,076 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:13,076 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:13,076 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:13,076 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-26 11:52:13,077 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:13,077 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:13,077 INFO  L85        PathProgramCache]: Analyzing trace with hash 877394660, now seen corresponding path program 1 times
[2023-11-26 11:52:13,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:13,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586616608]
[2023-11-26 11:52:13,083 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:13,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:13,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:13,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:13,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:13,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586616608]
[2023-11-26 11:52:13,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586616608] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:13,418 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:13,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-26 11:52:13,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929395805]
[2023-11-26 11:52:13,419 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:13,419 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-26 11:52:13,420 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:13,420 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-26 11:52:13,421 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-26 11:52:13,428 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2023-11-26 11:52:13,429 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 191 flow. Second operand  has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:13,429 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:13,429 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2023-11-26 11:52:13,429 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:14,972 INFO  L124   PetriNetUnfolderBase]: 5666/8690 cut-off events.
[2023-11-26 11:52:14,973 INFO  L125   PetriNetUnfolderBase]: For 7082/8220 co-relation queries the response was YES.
[2023-11-26 11:52:15,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23737 conditions, 8690 events. 5666/8690 cut-off events. For 7082/8220 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 59051 event pairs, 719 based on Foata normal form. 350/8752 useless extension candidates. Maximal degree in co-relation 23720. Up to 3506 conditions per place. 
[2023-11-26 11:52:15,099 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 58 selfloop transitions, 10 changer transitions 0/89 dead transitions.
[2023-11-26 11:52:15,099 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 450 flow
[2023-11-26 11:52:15,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-11-26 11:52:15,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-26 11:52:15,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions.
[2023-11-26 11:52:15,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.736
[2023-11-26 11:52:15,101 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 184 transitions.
[2023-11-26 11:52:15,101 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 184 transitions.
[2023-11-26 11:52:15,102 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:15,102 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 184 transitions.
[2023-11-26 11:52:15,103 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:15,104 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:15,105 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:15,105 INFO  L175             Difference]: Start difference. First operand has 61 places, 51 transitions, 191 flow. Second operand 5 states and 184 transitions.
[2023-11-26 11:52:15,105 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 450 flow
[2023-11-26 11:52:15,108 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-26 11:52:15,110 INFO  L231             Difference]: Finished difference. Result has 66 places, 56 transitions, 256 flow
[2023-11-26 11:52:15,110 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=66, PETRI_TRANSITIONS=56}
[2023-11-26 11:52:15,113 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places.
[2023-11-26 11:52:15,113 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 256 flow
[2023-11-26 11:52:15,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:15,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:15,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:15,114 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-26 11:52:15,115 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:15,116 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:15,116 INFO  L85        PathProgramCache]: Analyzing trace with hash -163786582, now seen corresponding path program 1 times
[2023-11-26 11:52:15,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:15,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358493595]
[2023-11-26 11:52:15,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:15,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:15,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:15,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:15,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:15,525 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358493595]
[2023-11-26 11:52:15,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358493595] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:15,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:15,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-26 11:52:15,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914275861]
[2023-11-26 11:52:15,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:15,527 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-26 11:52:15,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:15,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-26 11:52:15,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-26 11:52:15,541 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2023-11-26 11:52:15,542 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 256 flow. Second operand  has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:15,542 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:15,542 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2023-11-26 11:52:15,542 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:17,761 INFO  L124   PetriNetUnfolderBase]: 7562/12663 cut-off events.
[2023-11-26 11:52:17,762 INFO  L125   PetriNetUnfolderBase]: For 12269/14700 co-relation queries the response was YES.
[2023-11-26 11:52:17,833 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34540 conditions, 12663 events. 7562/12663 cut-off events. For 12269/14700 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 100931 event pairs, 2292 based on Foata normal form. 222/11964 useless extension candidates. Maximal degree in co-relation 34520. Up to 4936 conditions per place. 
[2023-11-26 11:52:17,906 INFO  L140   encePairwiseOnDemand]: 45/50 looper letters, 65 selfloop transitions, 4 changer transitions 0/101 dead transitions.
[2023-11-26 11:52:17,907 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 550 flow
[2023-11-26 11:52:17,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-26 11:52:17,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-26 11:52:17,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions.
[2023-11-26 11:52:17,909 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6866666666666666
[2023-11-26 11:52:17,910 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 206 transitions.
[2023-11-26 11:52:17,910 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions.
[2023-11-26 11:52:17,910 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:17,910 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions.
[2023-11-26 11:52:17,912 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:17,913 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:17,913 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:17,914 INFO  L175             Difference]: Start difference. First operand has 66 places, 56 transitions, 256 flow. Second operand 6 states and 206 transitions.
[2023-11-26 11:52:17,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 550 flow
[2023-11-26 11:52:17,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 535 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-11-26 11:52:17,924 INFO  L231             Difference]: Finished difference. Result has 73 places, 59 transitions, 276 flow
[2023-11-26 11:52:17,924 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=73, PETRI_TRANSITIONS=59}
[2023-11-26 11:52:17,925 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places.
[2023-11-26 11:52:17,925 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 276 flow
[2023-11-26 11:52:17,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:17,926 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:17,926 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:17,927 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-26 11:52:17,927 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:17,928 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:17,928 INFO  L85        PathProgramCache]: Analyzing trace with hash -22806136, now seen corresponding path program 2 times
[2023-11-26 11:52:17,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:17,928 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993354645]
[2023-11-26 11:52:17,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:17,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:17,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:18,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:18,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:18,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993354645]
[2023-11-26 11:52:18,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993354645] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:18,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:18,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-26 11:52:18,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831894594]
[2023-11-26 11:52:18,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:18,214 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-26 11:52:18,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:18,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-26 11:52:18,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-26 11:52:18,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2023-11-26 11:52:18,232 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 276 flow. Second operand  has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:18,232 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:18,232 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2023-11-26 11:52:18,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:20,584 INFO  L124   PetriNetUnfolderBase]: 7781/11783 cut-off events.
[2023-11-26 11:52:20,584 INFO  L125   PetriNetUnfolderBase]: For 17684/22078 co-relation queries the response was YES.
[2023-11-26 11:52:20,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36377 conditions, 11783 events. 7781/11783 cut-off events. For 17684/22078 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 80767 event pairs, 643 based on Foata normal form. 453/11747 useless extension candidates. Maximal degree in co-relation 36354. Up to 3588 conditions per place. 
[2023-11-26 11:52:20,744 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 69 selfloop transitions, 14 changer transitions 1/107 dead transitions.
[2023-11-26 11:52:20,745 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 612 flow
[2023-11-26 11:52:20,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-26 11:52:20,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-26 11:52:20,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions.
[2023-11-26 11:52:20,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.74
[2023-11-26 11:52:20,749 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 222 transitions.
[2023-11-26 11:52:20,749 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 222 transitions.
[2023-11-26 11:52:20,749 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:20,750 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 222 transitions.
[2023-11-26 11:52:20,753 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:20,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:20,755 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:20,755 INFO  L175             Difference]: Start difference. First operand has 73 places, 59 transitions, 276 flow. Second operand 6 states and 222 transitions.
[2023-11-26 11:52:20,756 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 612 flow
[2023-11-26 11:52:20,795 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 107 transitions, 609 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-26 11:52:20,800 INFO  L231             Difference]: Finished difference. Result has 79 places, 63 transitions, 350 flow
[2023-11-26 11:52:20,801 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=79, PETRI_TRANSITIONS=63}
[2023-11-26 11:52:20,802 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places.
[2023-11-26 11:52:20,803 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 350 flow
[2023-11-26 11:52:20,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:20,803 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:20,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:20,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-26 11:52:20,804 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:20,805 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:20,806 INFO  L85        PathProgramCache]: Analyzing trace with hash 513038416, now seen corresponding path program 1 times
[2023-11-26 11:52:20,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:20,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823529882]
[2023-11-26 11:52:20,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:20,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:20,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:21,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:21,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:21,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823529882]
[2023-11-26 11:52:21,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823529882] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:21,217 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:21,217 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-26 11:52:21,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945334607]
[2023-11-26 11:52:21,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:21,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-26 11:52:21,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:21,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-26 11:52:21,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2023-11-26 11:52:21,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2023-11-26 11:52:21,235 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 350 flow. Second operand  has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:21,235 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:21,235 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2023-11-26 11:52:21,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:22,802 INFO  L124   PetriNetUnfolderBase]: 6577/9803 cut-off events.
[2023-11-26 11:52:22,802 INFO  L125   PetriNetUnfolderBase]: For 29755/35670 co-relation queries the response was YES.
[2023-11-26 11:52:22,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35431 conditions, 9803 events. 6577/9803 cut-off events. For 29755/35670 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 65495 event pairs, 531 based on Foata normal form. 231/9561 useless extension candidates. Maximal degree in co-relation 35405. Up to 3528 conditions per place. 
[2023-11-26 11:52:22,889 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 57 selfloop transitions, 18 changer transitions 8/105 dead transitions.
[2023-11-26 11:52:22,889 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 105 transitions, 635 flow
[2023-11-26 11:52:22,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-26 11:52:22,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-26 11:52:22,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 244 transitions.
[2023-11-26 11:52:22,892 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6971428571428572
[2023-11-26 11:52:22,892 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 244 transitions.
[2023-11-26 11:52:22,892 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 244 transitions.
[2023-11-26 11:52:22,893 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:22,893 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 244 transitions.
[2023-11-26 11:52:22,894 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:22,896 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:22,896 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:22,897 INFO  L175             Difference]: Start difference. First operand has 79 places, 63 transitions, 350 flow. Second operand 7 states and 244 transitions.
[2023-11-26 11:52:22,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 105 transitions, 635 flow
[2023-11-26 11:52:23,138 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 105 transitions, 588 flow, removed 14 selfloop flow, removed 5 redundant places.
[2023-11-26 11:52:23,141 INFO  L231             Difference]: Finished difference. Result has 81 places, 63 transitions, 361 flow
[2023-11-26 11:52:23,141 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=81, PETRI_TRANSITIONS=63}
[2023-11-26 11:52:23,144 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places.
[2023-11-26 11:52:23,144 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 361 flow
[2023-11-26 11:52:23,146 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:23,146 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:23,146 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:23,146 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-26 11:52:23,147 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:23,147 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:23,147 INFO  L85        PathProgramCache]: Analyzing trace with hash -245477974, now seen corresponding path program 1 times
[2023-11-26 11:52:23,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:23,148 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899921566]
[2023-11-26 11:52:23,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:23,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:23,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-26 11:52:23,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-26 11:52:23,545 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-26 11:52:23,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899921566]
[2023-11-26 11:52:23,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899921566] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-26 11:52:23,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-26 11:52:23,546 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-26 11:52:23,546 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548020023]
[2023-11-26 11:52:23,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-26 11:52:23,547 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-26 11:52:23,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-26 11:52:23,548 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-26 11:52:23,548 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-26 11:52:23,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50
[2023-11-26 11:52:23,555 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 361 flow. Second operand  has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:23,555 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-26 11:52:23,555 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50
[2023-11-26 11:52:23,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-26 11:52:25,125 INFO  L124   PetriNetUnfolderBase]: 6012/11153 cut-off events.
[2023-11-26 11:52:25,125 INFO  L125   PetriNetUnfolderBase]: For 24080/26429 co-relation queries the response was YES.
[2023-11-26 11:52:25,230 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34163 conditions, 11153 events. 6012/11153 cut-off events. For 24080/26429 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 97453 event pairs, 1449 based on Foata normal form. 111/9981 useless extension candidates. Maximal degree in co-relation 34137. Up to 3558 conditions per place. 
[2023-11-26 11:52:25,252 INFO  L140   encePairwiseOnDemand]: 45/50 looper letters, 31 selfloop transitions, 1 changer transitions 25/95 dead transitions.
[2023-11-26 11:52:25,252 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 95 transitions, 577 flow
[2023-11-26 11:52:25,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-26 11:52:25,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-26 11:52:25,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions.
[2023-11-26 11:52:25,254 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6433333333333333
[2023-11-26 11:52:25,255 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 193 transitions.
[2023-11-26 11:52:25,255 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 193 transitions.
[2023-11-26 11:52:25,255 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-26 11:52:25,255 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 193 transitions.
[2023-11-26 11:52:25,256 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:25,257 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:25,258 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:25,258 INFO  L175             Difference]: Start difference. First operand has 81 places, 63 transitions, 361 flow. Second operand 6 states and 193 transitions.
[2023-11-26 11:52:25,258 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 95 transitions, 577 flow
[2023-11-26 11:52:25,752 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 95 transitions, 502 flow, removed 26 selfloop flow, removed 7 redundant places.
[2023-11-26 11:52:25,753 INFO  L231             Difference]: Finished difference. Result has 82 places, 62 transitions, 305 flow
[2023-11-26 11:52:25,754 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=82, PETRI_TRANSITIONS=62}
[2023-11-26 11:52:25,754 INFO  L281   CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places.
[2023-11-26 11:52:25,755 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 305 flow
[2023-11-26 11:52:25,755 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-26 11:52:25,755 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-26 11:52:25,755 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:25,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-26 11:52:25,756 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-26 11:52:25,756 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-26 11:52:25,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -174210650, now seen corresponding path program 2 times
[2023-11-26 11:52:25,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-26 11:52:25,757 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281128194]
[2023-11-26 11:52:25,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-26 11:52:25,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-26 11:52:25,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 11:52:25,808 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-26 11:52:25,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-26 11:52:25,919 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-26 11:52:25,920 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-26 11:52:25,921 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2023-11-26 11:52:25,923 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2023-11-26 11:52:25,924 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2023-11-26 11:52:25,924 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2023-11-26 11:52:25,924 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2023-11-26 11:52:25,925 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2023-11-26 11:52:25,925 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2023-11-26 11:52:25,925 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-26 11:52:25,925 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1]
[2023-11-26 11:52:25,933 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-26 11:52:25,933 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-26 11:52:26,011 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-26 11:52:26,016 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-26 11:52:26,018 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-26 11:52:26,027 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-26 11:52:26,083 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:52:26 BasicIcfg
[2023-11-26 11:52:26,084 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-26 11:52:26,084 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-26 11:52:26,084 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2023-11-26 11:52:26,085 INFO  L274        PluginConnector]: Witness Printer initialized
[2023-11-26 11:52:26,085 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:52:06" (3/4) ...
[2023-11-26 11:52:26,086 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2023-11-26 11:52:26,144 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-26 11:52:26,145 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-26 11:52:26,147 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-26 11:52:26,148 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-26 11:52:26,273 INFO  L149         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/witness.graphml
[2023-11-26 11:52:26,273 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-26 11:52:26,274 INFO  L158              Benchmark]: Toolchain (without parser) took 22126.83ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 117.7MB in the beginning and 781.1MB in the end (delta: -663.5MB). Peak memory consumption was 634.9MB. Max. memory is 16.1GB.
[2023-11-26 11:52:26,274 INFO  L158              Benchmark]: CDTParser took 0.28ms. Allocated memory is still 146.8MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-26 11:52:26,274 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 666.05ms. Allocated memory is still 146.8MB. Free memory was 117.7MB in the beginning and 94.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2023-11-26 11:52:26,275 INFO  L158              Benchmark]: Boogie Procedure Inliner took 119.75ms. Allocated memory is still 146.8MB. Free memory was 94.0MB in the beginning and 91.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-26 11:52:26,275 INFO  L158              Benchmark]: Boogie Preprocessor took 99.67ms. Allocated memory is still 146.8MB. Free memory was 91.3MB in the beginning and 88.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-26 11:52:26,276 INFO  L158              Benchmark]: RCFGBuilder took 998.29ms. Allocated memory is still 146.8MB. Free memory was 88.1MB in the beginning and 40.2MB in the end (delta: 47.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB.
[2023-11-26 11:52:26,276 INFO  L158              Benchmark]: TraceAbstraction took 20047.52ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.9MB in the beginning and 800.0MB in the end (delta: -760.1MB). Peak memory consumption was 538.5MB. Max. memory is 16.1GB.
[2023-11-26 11:52:26,277 INFO  L158              Benchmark]: Witness Printer took 188.79ms. Allocated memory is still 1.4GB. Free memory was 800.0MB in the beginning and 781.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2023-11-26 11:52:26,279 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.28ms. Allocated memory is still 146.8MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 666.05ms. Allocated memory is still 146.8MB. Free memory was 117.7MB in the beginning and 94.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 119.75ms. Allocated memory is still 146.8MB. Free memory was 94.0MB in the beginning and 91.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 99.67ms. Allocated memory is still 146.8MB. Free memory was 91.3MB in the beginning and 88.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 998.29ms. Allocated memory is still 146.8MB. Free memory was 88.1MB in the beginning and 40.2MB in the end (delta: 47.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 20047.52ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 39.9MB in the beginning and 800.0MB in the end (delta: -760.1MB). Peak memory consumption was 538.5MB. Max. memory is 16.1GB.
 * Witness Printer took 188.79ms. Allocated memory is still 1.4GB. Free memory was 800.0MB in the beginning and 781.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p1_EAX = 0;
[L716]               0  int __unbuffered_p2_EAX = 0;
[L718]               0  int __unbuffered_p3_EAX = 0;
[L720]               0  int __unbuffered_p3_EBX = 0;
[L722]               0  int a = 0;
[L724]               0  int b = 0;
[L725]               0  _Bool main$tmp_guard0;
[L726]               0  _Bool main$tmp_guard1;
[L728]               0  int x = 0;
[L730]               0  int y = 0;
[L732]               0  int z = 0;
[L733]               0  _Bool z$flush_delayed;
[L734]               0  int z$mem_tmp;
[L735]               0  _Bool z$r_buff0_thd0;
[L736]               0  _Bool z$r_buff0_thd1;
[L737]               0  _Bool z$r_buff0_thd2;
[L738]               0  _Bool z$r_buff0_thd3;
[L739]               0  _Bool z$r_buff0_thd4;
[L740]               0  _Bool z$r_buff1_thd0;
[L741]               0  _Bool z$r_buff1_thd1;
[L742]               0  _Bool z$r_buff1_thd2;
[L743]               0  _Bool z$r_buff1_thd3;
[L744]               0  _Bool z$r_buff1_thd4;
[L745]               0  _Bool z$read_delayed;
[L746]               0  int *z$read_delayed_var;
[L747]               0  int z$w_buff0;
[L748]               0  _Bool z$w_buff0_used;
[L749]               0  int z$w_buff1;
[L750]               0  _Bool z$w_buff1_used;
[L751]               0  _Bool weak$$choice0;
[L752]               0  _Bool weak$$choice2;
[L858]               0  pthread_t t949;
[L859]  FCALL, FORK  0  pthread_create(&t949, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L860]               0  pthread_t t950;
[L861]  FCALL, FORK  0  pthread_create(&t950, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L862]               0  pthread_t t951;
[L863]  FCALL, FORK  0  pthread_create(&t951, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L864]               0  pthread_t t952;
[L865]  FCALL, FORK  0  pthread_create(&t952, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L814]               4  z$w_buff1 = z$w_buff0
[L815]               4  z$w_buff0 = 1
[L816]               4  z$w_buff1_used = z$w_buff0_used
[L817]               4  z$w_buff0_used = (_Bool)1
[L818]  CALL         4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   4  !(!expression)
[L818]  RET          4  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L819]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L820]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L821]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L822]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L823]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L824]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L827]               4  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L830]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L833]               4  __unbuffered_p3_EBX = b
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L756]               1  b = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L759]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L771]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L774]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L786]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L789]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L790]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L791]               3  z$flush_delayed = weak$$choice2
[L792]               3  z$mem_tmp = z
[L793]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L794]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L795]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L796]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L797]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L798]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L799]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L800]               3  __unbuffered_p2_EAX = z
[L801]               3  z = z$flush_delayed ? z$mem_tmp : z
[L802]               3  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L836]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L837]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L838]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L839]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L840]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L764]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L779]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L807]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L843]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L867]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L869]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L869]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L871]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L872]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L873]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L874]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L875]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L878]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
        VAL             [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L880]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18]                0  reach_error()
        VAL             [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]

  - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 511 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1047 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 19 mSDtfsCounter, 1047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=8, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-11-26 11:52:26,319 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_edde9ba5-9117-466e-9c85-a62730e126a9/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE