./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ --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 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:43:09,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:43:09,234 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 21:43:09,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:43:09,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:43:09,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:43:09,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:43:09,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:43:09,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:43:09,273 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:43:09,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:43:09,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:43:09,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:43:09,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:43:09,279 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:43:09,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:43:09,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:43:09,284 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:43:09,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:43:09,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:43:09,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:43:09,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:43:09,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:43:09,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:43:09,294 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:43:09,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:43:09,295 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:43:09,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:43:09,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:43:09,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:43:09,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:43:09,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:43:09,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:43:09,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:43:09,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:43:09,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:43:09,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:43:09,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:43:09,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:43:09,303 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:43:09,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:43:09,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:43:09,304 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_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/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_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ 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 -> 8dbd267b0e0821e8d358e8d234024d8e484ea32431972ed8b70b87052179a50c [2023-11-23 21:43:09,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:43:09,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:43:09,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:43:09,662 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:43:09,662 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:43:09,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2023-11-23 21:43:12,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:43:13,127 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:43:13,129 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c [2023-11-23 21:43:13,143 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/data/1edbf4a3b/f37445893dd84f789439ee8e44caca91/FLAG705253a57 [2023-11-23 21:43:13,161 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/data/1edbf4a3b/f37445893dd84f789439ee8e44caca91 [2023-11-23 21:43:13,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:43:13,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:43:13,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:43:13,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:43:13,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:43:13,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1337f92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13, skipping insertion in model container [2023-11-23 21:43:13,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,235 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:43:13,525 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_7810092e-18f3-4929-933c-a5865bc70522/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4403,4416] [2023-11-23 21:43:13,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:43:13,571 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:43:13,621 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_7810092e-18f3-4929-933c-a5865bc70522/sv-benchmarks/c/weaver/popl20-more-buffer-series.wvr.c[4403,4416] [2023-11-23 21:43:13,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:43:13,646 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:43:13,647 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:43:13,655 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:43:13,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13 WrapperNode [2023-11-23 21:43:13,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:43:13,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:43:13,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:43:13,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:43:13,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,729 INFO L138 Inliner]: procedures = 27, calls = 87, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 364 [2023-11-23 21:43:13,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:43:13,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:43:13,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:43:13,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:43:13,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,751 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,770 INFO L189 HeapSplitter]: Split 20 memory accesses to 6 slices as follows [2, 2, 2, 2, 2, 10] [2023-11-23 21:43:13,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:43:13,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:43:13,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:43:13,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:43:13,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (1/1) ... [2023-11-23 21:43:13,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:43:13,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:13,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:43:13,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:43:13,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:43:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:43:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 21:43:13,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 21:43:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 21:43:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 21:43:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 21:43:13,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 21:43:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 21:43:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 21:43:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 21:43:13,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 21:43:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 21:43:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 21:43:13,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-23 21:43:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-23 21:43:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-23 21:43:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-23 21:43:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-23 21:43:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-23 21:43:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-23 21:43:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-23 21:43:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 21:43:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 21:43:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 21:43:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 21:43:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 21:43:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 21:43:13,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:43:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:43:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:43:13,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:43:13,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:43:13,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:43:13,940 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:43:14,154 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:43:14,156 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:43:14,777 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:43:15,368 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:43:15,369 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-23 21:43:15,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:15 BoogieIcfgContainer [2023-11-23 21:43:15,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:43:15,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:43:15,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:43:15,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:43:15,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:43:13" (1/3) ... [2023-11-23 21:43:15,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222cee20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:15, skipping insertion in model container [2023-11-23 21:43:15,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:13" (2/3) ... [2023-11-23 21:43:15,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222cee20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:15, skipping insertion in model container [2023-11-23 21:43:15,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:15" (3/3) ... [2023-11-23 21:43:15,383 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2023-11-23 21:43:15,399 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 21:43:15,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:43:15,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:43:15,410 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:43:15,492 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-23 21:43:15,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 55 transitions, 138 flow [2023-11-23 21:43:15,639 INFO L124 PetriNetUnfolderBase]: 7/51 cut-off events. [2023-11-23 21:43:15,639 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-23 21:43:15,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 51 events. 7/51 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2023-11-23 21:43:15,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 55 transitions, 138 flow [2023-11-23 21:43:15,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 50 transitions, 124 flow [2023-11-23 21:43:15,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:43:15,679 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;@4c016c2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:43:15,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-23 21:43:15,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:43:15,707 INFO L124 PetriNetUnfolderBase]: 7/49 cut-off events. [2023-11-23 21:43:15,707 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-23 21:43:15,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:15,708 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-23 21:43:15,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:15,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2047244802, now seen corresponding path program 1 times [2023-11-23 21:43:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:15,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983330843] [2023-11-23 21:43:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:16,193 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-23 21:43:16,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:16,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983330843] [2023-11-23 21:43:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983330843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:16,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:16,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103030097] [2023-11-23 21:43:16,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:16,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:16,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:16,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2023-11-23 21:43:16,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-23 21:43:16,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:16,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2023-11-23 21:43:16,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:17,181 INFO L124 PetriNetUnfolderBase]: 2614/4015 cut-off events. [2023-11-23 21:43:17,182 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2023-11-23 21:43:17,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7557 conditions, 4015 events. 2614/4015 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 23047 event pairs, 505 based on Foata normal form. 1/3781 useless extension candidates. Maximal degree in co-relation 6271. Up to 2275 conditions per place. [2023-11-23 21:43:17,231 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 49 selfloop transitions, 3 changer transitions 1/70 dead transitions. [2023-11-23 21:43:17,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 285 flow [2023-11-23 21:43:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:17,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-23 21:43:17,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-23 21:43:17,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-23 21:43:17,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-23 21:43:17,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:17,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-23 21:43:17,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-23 21:43:17,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-23 21:43:17,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-23 21:43:17,269 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 124 flow. Second operand 3 states and 117 transitions. [2023-11-23 21:43:17,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 285 flow [2023-11-23 21:43:17,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 259 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-23 21:43:17,287 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 127 flow [2023-11-23 21:43:17,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-11-23 21:43:17,294 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2023-11-23 21:43:17,294 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 127 flow [2023-11-23 21:43:17,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-23 21:43:17,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:17,295 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] [2023-11-23 21:43:17,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:43:17,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:17,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1025146033, now seen corresponding path program 1 times [2023-11-23 21:43:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:17,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144075763] [2023-11-23 21:43:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:17,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:43:17,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:17,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144075763] [2023-11-23 21:43:17,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144075763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:17,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98272290] [2023-11-23 21:43:17,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:17,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:17,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:17,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2023-11-23 21:43:17,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-23 21:43:17,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:17,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2023-11-23 21:43:17,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:18,384 INFO L124 PetriNetUnfolderBase]: 2708/4027 cut-off events. [2023-11-23 21:43:18,384 INFO L125 PetriNetUnfolderBase]: For 724/724 co-relation queries the response was YES. [2023-11-23 21:43:18,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8506 conditions, 4027 events. 2708/4027 cut-off events. For 724/724 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 22735 event pairs, 651 based on Foata normal form. 96/3945 useless extension candidates. Maximal degree in co-relation 2885. Up to 2592 conditions per place. [2023-11-23 21:43:18,424 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 57 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-23 21:43:18,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 307 flow [2023-11-23 21:43:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:18,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:18,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:18,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:18,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:18,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:18,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-23 21:43:18,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-23 21:43:18,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-23 21:43:18,432 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 127 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:18,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 307 flow [2023-11-23 21:43:18,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 21:43:18,436 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 138 flow [2023-11-23 21:43:18,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2023-11-23 21:43:18,437 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2023-11-23 21:43:18,437 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 138 flow [2023-11-23 21:43:18,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-23 21:43:18,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:18,438 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] [2023-11-23 21:43:18,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:43:18,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:18,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash 560322323, now seen corresponding path program 1 times [2023-11-23 21:43:18,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:18,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21750931] [2023-11-23 21:43:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:43:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21750931] [2023-11-23 21:43:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21750931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:18,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:18,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404861461] [2023-11-23 21:43:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:18,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:18,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:18,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:18,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2023-11-23 21:43:18,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-23 21:43:18,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:18,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2023-11-23 21:43:18,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:19,390 INFO L124 PetriNetUnfolderBase]: 2668/4245 cut-off events. [2023-11-23 21:43:19,391 INFO L125 PetriNetUnfolderBase]: For 1586/1586 co-relation queries the response was YES. [2023-11-23 21:43:19,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9218 conditions, 4245 events. 2668/4245 cut-off events. For 1586/1586 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 26331 event pairs, 655 based on Foata normal form. 62/4152 useless extension candidates. Maximal degree in co-relation 6691. Up to 2665 conditions per place. [2023-11-23 21:43:19,432 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 57 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-23 21:43:19,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 323 flow [2023-11-23 21:43:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-23 21:43:19,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-23 21:43:19,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-23 21:43:19,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-23 21:43:19,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:19,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-23 21:43:19,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-23 21:43:19,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-23 21:43:19,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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-23 21:43:19,445 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 138 flow. Second operand 3 states and 118 transitions. [2023-11-23 21:43:19,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 323 flow [2023-11-23 21:43:19,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 21:43:19,451 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 150 flow [2023-11-23 21:43:19,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2023-11-23 21:43:19,453 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2023-11-23 21:43:19,453 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 150 flow [2023-11-23 21:43:19,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-23 21:43:19,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:19,454 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, 1, 1] [2023-11-23 21:43:19,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:43:19,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:19,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1263693964, now seen corresponding path program 1 times [2023-11-23 21:43:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:19,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535136323] [2023-11-23 21:43:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:43:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:19,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535136323] [2023-11-23 21:43:19,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535136323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:19,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:19,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:43:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219371216] [2023-11-23 21:43:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:19,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:43:19,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:19,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:43:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:43:19,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2023-11-23 21:43:19,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-23 21:43:19,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:19,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2023-11-23 21:43:19,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:20,780 INFO L124 PetriNetUnfolderBase]: 3181/4981 cut-off events. [2023-11-23 21:43:20,781 INFO L125 PetriNetUnfolderBase]: For 2596/2596 co-relation queries the response was YES. [2023-11-23 21:43:20,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11613 conditions, 4981 events. 3181/4981 cut-off events. For 2596/2596 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32964 event pairs, 2375 based on Foata normal form. 93/4572 useless extension candidates. Maximal degree in co-relation 5288. Up to 3497 conditions per place. [2023-11-23 21:43:20,826 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 65 selfloop transitions, 7 changer transitions 0/89 dead transitions. [2023-11-23 21:43:20,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 89 transitions, 387 flow [2023-11-23 21:43:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:43:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:43:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2023-11-23 21:43:20,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6254545454545455 [2023-11-23 21:43:20,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 172 transitions. [2023-11-23 21:43:20,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 172 transitions. [2023-11-23 21:43:20,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:20,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 172 transitions. [2023-11-23 21:43:20,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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-23 21:43:20,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 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-23 21:43:20,835 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 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-23 21:43:20,835 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 150 flow. Second operand 5 states and 172 transitions. [2023-11-23 21:43:20,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 89 transitions, 387 flow [2023-11-23 21:43:20,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 21:43:20,840 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 200 flow [2023-11-23 21:43:20,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-11-23 21:43:20,843 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2023-11-23 21:43:20,844 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 200 flow [2023-11-23 21:43:20,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-23 21:43:20,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:20,848 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, 1, 1] [2023-11-23 21:43:20,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:43:20,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:20,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1826608772, now seen corresponding path program 1 times [2023-11-23 21:43:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:20,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650882691] [2023-11-23 21:43:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:20,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:43:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:21,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650882691] [2023-11-23 21:43:21,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650882691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:21,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:21,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:43:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228057496] [2023-11-23 21:43:21,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:21,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:43:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:21,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:43:21,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:43:21,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2023-11-23 21:43:21,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-23 21:43:21,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:21,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2023-11-23 21:43:21,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:22,154 INFO L124 PetriNetUnfolderBase]: 3920/6334 cut-off events. [2023-11-23 21:43:22,155 INFO L125 PetriNetUnfolderBase]: For 3298/3298 co-relation queries the response was YES. [2023-11-23 21:43:22,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 6334 events. 3920/6334 cut-off events. For 3298/3298 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 45201 event pairs, 3013 based on Foata normal form. 154/5894 useless extension candidates. Maximal degree in co-relation 11676. Up to 4412 conditions per place. [2023-11-23 21:43:22,218 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 67 selfloop transitions, 7 changer transitions 2/93 dead transitions. [2023-11-23 21:43:22,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 462 flow [2023-11-23 21:43:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:43:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:43:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2023-11-23 21:43:22,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.610909090909091 [2023-11-23 21:43:22,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 168 transitions. [2023-11-23 21:43:22,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 168 transitions. [2023-11-23 21:43:22,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:22,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 168 transitions. [2023-11-23 21:43:22,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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-23 21:43:22,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 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-23 21:43:22,223 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 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-23 21:43:22,223 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 200 flow. Second operand 5 states and 168 transitions. [2023-11-23 21:43:22,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 462 flow [2023-11-23 21:43:22,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 458 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-23 21:43:22,230 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 250 flow [2023-11-23 21:43:22,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2023-11-23 21:43:22,232 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2023-11-23 21:43:22,232 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 250 flow [2023-11-23 21:43:22,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-23 21:43:22,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:22,232 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, 1, 1, 1] [2023-11-23 21:43:22,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:43:22,233 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:22,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1998559404, now seen corresponding path program 1 times [2023-11-23 21:43:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:22,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240998090] [2023-11-23 21:43:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 21:43:22,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240998090] [2023-11-23 21:43:22,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240998090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:22,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:22,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:22,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343562565] [2023-11-23 21:43:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:22,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:22,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:22,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:22,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2023-11-23 21:43:22,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-23 21:43:22,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:22,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2023-11-23 21:43:22,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:25,160 INFO L124 PetriNetUnfolderBase]: 9630/14649 cut-off events. [2023-11-23 21:43:25,161 INFO L125 PetriNetUnfolderBase]: For 6965/6965 co-relation queries the response was YES. [2023-11-23 21:43:25,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33869 conditions, 14649 events. 9630/14649 cut-off events. For 6965/6965 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 106481 event pairs, 3840 based on Foata normal form. 0/13529 useless extension candidates. Maximal degree in co-relation 29088. Up to 5258 conditions per place. [2023-11-23 21:43:25,284 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 107 selfloop transitions, 11 changer transitions 1/133 dead transitions. [2023-11-23 21:43:25,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 133 transitions, 705 flow [2023-11-23 21:43:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2023-11-23 21:43:25,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2023-11-23 21:43:25,286 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 208 transitions. [2023-11-23 21:43:25,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 208 transitions. [2023-11-23 21:43:25,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:25,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 208 transitions. [2023-11-23 21:43:25,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 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-23 21:43:25,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:25,290 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:25,290 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 250 flow. Second operand 6 states and 208 transitions. [2023-11-23 21:43:25,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 133 transitions, 705 flow [2023-11-23 21:43:25,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 133 transitions, 693 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-23 21:43:25,299 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 298 flow [2023-11-23 21:43:25,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2023-11-23 21:43:25,302 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places. [2023-11-23 21:43:25,302 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 298 flow [2023-11-23 21:43:25,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-23 21:43:25,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:25,303 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, 1, 1, 1] [2023-11-23 21:43:25,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:43:25,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:25,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:25,304 INFO L85 PathProgramCache]: Analyzing trace with hash 379384490, now seen corresponding path program 1 times [2023-11-23 21:43:25,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:25,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289363237] [2023-11-23 21:43:25,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:25,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 21:43:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:25,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289363237] [2023-11-23 21:43:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289363237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:25,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:25,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652603244] [2023-11-23 21:43:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:25,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:25,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:25,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2023-11-23 21:43:25,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-23 21:43:25,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:25,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2023-11-23 21:43:25,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:27,446 INFO L124 PetriNetUnfolderBase]: 8533/13105 cut-off events. [2023-11-23 21:43:27,446 INFO L125 PetriNetUnfolderBase]: For 6739/6756 co-relation queries the response was YES. [2023-11-23 21:43:27,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31600 conditions, 13105 events. 8533/13105 cut-off events. For 6739/6756 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 92181 event pairs, 3447 based on Foata normal form. 0/11959 useless extension candidates. Maximal degree in co-relation 26294. Up to 6010 conditions per place. [2023-11-23 21:43:27,555 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 71 selfloop transitions, 8 changer transitions 33/126 dead transitions. [2023-11-23 21:43:27,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 126 transitions, 685 flow [2023-11-23 21:43:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-23 21:43:27,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6151515151515151 [2023-11-23 21:43:27,558 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-23 21:43:27,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-23 21:43:27,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:27,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-23 21:43:27,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 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-23 21:43:27,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:27,560 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:27,561 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 298 flow. Second operand 6 states and 203 transitions. [2023-11-23 21:43:27,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 126 transitions, 685 flow [2023-11-23 21:43:27,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 126 transitions, 674 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-23 21:43:27,570 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 292 flow [2023-11-23 21:43:27,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2023-11-23 21:43:27,571 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2023-11-23 21:43:27,572 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 292 flow [2023-11-23 21:43:27,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-23 21:43:27,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:27,572 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, 1, 1, 1, 1] [2023-11-23 21:43:27,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:43:27,573 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:27,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:27,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1530121887, now seen corresponding path program 1 times [2023-11-23 21:43:27,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:27,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146282868] [2023-11-23 21:43:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 21:43:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:27,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146282868] [2023-11-23 21:43:27,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146282868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:27,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:27,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920979681] [2023-11-23 21:43:27,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:27,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:27,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:27,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:27,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2023-11-23 21:43:27,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 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-23 21:43:27,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:27,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2023-11-23 21:43:27,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:29,458 INFO L124 PetriNetUnfolderBase]: 5673/8465 cut-off events. [2023-11-23 21:43:29,458 INFO L125 PetriNetUnfolderBase]: For 5700/5700 co-relation queries the response was YES. [2023-11-23 21:43:29,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22287 conditions, 8465 events. 5673/8465 cut-off events. For 5700/5700 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 53988 event pairs, 353 based on Foata normal form. 266/8540 useless extension candidates. Maximal degree in co-relation 19909. Up to 5108 conditions per place. [2023-11-23 21:43:29,572 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 73 selfloop transitions, 7 changer transitions 4/99 dead transitions. [2023-11-23 21:43:29,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 578 flow [2023-11-23 21:43:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2023-11-23 21:43:29,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2023-11-23 21:43:29,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 180 transitions. [2023-11-23 21:43:29,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 180 transitions. [2023-11-23 21:43:29,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:29,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 180 transitions. [2023-11-23 21:43:29,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-23 21:43:29,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:29,581 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:29,582 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 292 flow. Second operand 6 states and 180 transitions. [2023-11-23 21:43:29,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 578 flow [2023-11-23 21:43:29,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 562 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-23 21:43:29,627 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 256 flow [2023-11-23 21:43:29,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2023-11-23 21:43:29,632 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2023-11-23 21:43:29,632 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 256 flow [2023-11-23 21:43:29,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 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-23 21:43:29,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:29,633 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, 1, 1, 1, 1] [2023-11-23 21:43:29,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:43:29,634 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:29,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1394603491, now seen corresponding path program 1 times [2023-11-23 21:43:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:29,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258666149] [2023-11-23 21:43:29,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:29,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:43:30,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258666149] [2023-11-23 21:43:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258666149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046373477] [2023-11-23 21:43:30,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:30,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:30,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:30,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:30,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2023-11-23 21:43:30,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 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-23 21:43:30,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:30,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2023-11-23 21:43:30,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:31,110 INFO L124 PetriNetUnfolderBase]: 4582/6866 cut-off events. [2023-11-23 21:43:31,111 INFO L125 PetriNetUnfolderBase]: For 5763/5927 co-relation queries the response was YES. [2023-11-23 21:43:31,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18221 conditions, 6866 events. 4582/6866 cut-off events. For 5763/5927 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 41988 event pairs, 430 based on Foata normal form. 432/7173 useless extension candidates. Maximal degree in co-relation 18187. Up to 3504 conditions per place. [2023-11-23 21:43:31,170 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 73 selfloop transitions, 5 changer transitions 2/95 dead transitions. [2023-11-23 21:43:31,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 95 transitions, 544 flow [2023-11-23 21:43:31,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2023-11-23 21:43:31,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2023-11-23 21:43:31,173 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 180 transitions. [2023-11-23 21:43:31,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 180 transitions. [2023-11-23 21:43:31,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:31,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 180 transitions. [2023-11-23 21:43:31,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 30.0) internal successors, (180), 6 states have internal predecessors, (180), 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-23 21:43:31,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:31,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:31,176 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 256 flow. Second operand 6 states and 180 transitions. [2023-11-23 21:43:31,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 95 transitions, 544 flow [2023-11-23 21:43:31,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 95 transitions, 508 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-23 21:43:31,182 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 222 flow [2023-11-23 21:43:31,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2023-11-23 21:43:31,183 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2023-11-23 21:43:31,183 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 222 flow [2023-11-23 21:43:31,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 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-23 21:43:31,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:31,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:31,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:43:31,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:31,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1958447694, now seen corresponding path program 1 times [2023-11-23 21:43:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:31,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243748445] [2023-11-23 21:43:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:43:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243748445] [2023-11-23 21:43:31,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243748445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:43:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807497896] [2023-11-23 21:43:31,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:31,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:43:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:31,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:43:31,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:43:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:31,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 21:43:31,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:43:32,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:43:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:43:32,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807497896] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:43:32,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:43:32,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2023-11-23 21:43:32,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399280459] [2023-11-23 21:43:32,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:43:32,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 21:43:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:32,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 21:43:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-23 21:43:32,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2023-11-23 21:43:32,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 222 flow. Second operand has 18 states, 18 states have (on average 21.72222222222222) internal successors, (391), 18 states have internal predecessors, (391), 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-23 21:43:32,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:32,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2023-11-23 21:43:32,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:34,503 INFO L124 PetriNetUnfolderBase]: 7836/11081 cut-off events. [2023-11-23 21:43:34,503 INFO L125 PetriNetUnfolderBase]: For 9624/10163 co-relation queries the response was YES. [2023-11-23 21:43:34,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30862 conditions, 11081 events. 7836/11081 cut-off events. For 9624/10163 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 67779 event pairs, 273 based on Foata normal form. 539/11320 useless extension candidates. Maximal degree in co-relation 30829. Up to 3116 conditions per place. [2023-11-23 21:43:34,619 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 152 selfloop transitions, 16 changer transitions 0/182 dead transitions. [2023-11-23 21:43:34,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 182 transitions, 1025 flow [2023-11-23 21:43:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 21:43:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-23 21:43:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 358 transitions. [2023-11-23 21:43:34,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5424242424242425 [2023-11-23 21:43:34,622 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 358 transitions. [2023-11-23 21:43:34,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 358 transitions. [2023-11-23 21:43:34,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:34,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 358 transitions. [2023-11-23 21:43:34,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 29.833333333333332) internal successors, (358), 12 states have internal predecessors, (358), 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-23 21:43:34,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 55.0) internal successors, (715), 13 states have internal predecessors, (715), 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-23 21:43:34,626 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 55.0) internal successors, (715), 13 states have internal predecessors, (715), 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-23 21:43:34,626 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 222 flow. Second operand 12 states and 358 transitions. [2023-11-23 21:43:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 182 transitions, 1025 flow [2023-11-23 21:43:34,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 182 transitions, 975 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-11-23 21:43:34,635 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 280 flow [2023-11-23 21:43:34,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=280, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2023-11-23 21:43:34,636 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2023-11-23 21:43:34,636 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 280 flow [2023-11-23 21:43:34,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.72222222222222) internal successors, (391), 18 states have internal predecessors, (391), 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-23 21:43:34,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:34,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:34,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:34,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 21:43:34,851 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:34,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1635245046, now seen corresponding path program 1 times [2023-11-23 21:43:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725666140] [2023-11-23 21:43:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:43:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725666140] [2023-11-23 21:43:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725666140] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:43:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730513174] [2023-11-23 21:43:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:35,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:43:35,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:35,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:43:35,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:43:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:35,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-23 21:43:35,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:43:35,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:43:35,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 21:43:35,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730513174] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:43:35,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:43:35,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2023-11-23 21:43:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314547659] [2023-11-23 21:43:35,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:43:35,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 21:43:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 21:43:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-23 21:43:36,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 55 [2023-11-23 21:43:36,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 280 flow. Second operand has 18 states, 18 states have (on average 21.944444444444443) internal successors, (395), 18 states have internal predecessors, (395), 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-23 21:43:36,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:36,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 55 [2023-11-23 21:43:36,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:38,450 INFO L124 PetriNetUnfolderBase]: 10756/15279 cut-off events. [2023-11-23 21:43:38,451 INFO L125 PetriNetUnfolderBase]: For 21246/22290 co-relation queries the response was YES. [2023-11-23 21:43:38,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46855 conditions, 15279 events. 10756/15279 cut-off events. For 21246/22290 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 96330 event pairs, 357 based on Foata normal form. 433/15287 useless extension candidates. Maximal degree in co-relation 46824. Up to 4662 conditions per place. [2023-11-23 21:43:38,579 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 182 selfloop transitions, 16 changer transitions 0/217 dead transitions. [2023-11-23 21:43:38,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 217 transitions, 1404 flow [2023-11-23 21:43:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 21:43:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-23 21:43:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 356 transitions. [2023-11-23 21:43:38,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2023-11-23 21:43:38,582 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 356 transitions. [2023-11-23 21:43:38,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 356 transitions. [2023-11-23 21:43:38,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:38,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 356 transitions. [2023-11-23 21:43:38,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 29.666666666666668) internal successors, (356), 12 states have internal predecessors, (356), 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-23 21:43:38,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 55.0) internal successors, (715), 13 states have internal predecessors, (715), 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-23 21:43:38,586 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 55.0) internal successors, (715), 13 states have internal predecessors, (715), 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-23 21:43:38,586 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 280 flow. Second operand 12 states and 356 transitions. [2023-11-23 21:43:38,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 217 transitions, 1404 flow [2023-11-23 21:43:38,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 217 transitions, 1334 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-11-23 21:43:38,615 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 346 flow [2023-11-23 21:43:38,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=346, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2023-11-23 21:43:38,616 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2023-11-23 21:43:38,616 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 346 flow [2023-11-23 21:43:38,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.944444444444443) internal successors, (395), 18 states have internal predecessors, (395), 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-23 21:43:38,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:38,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:38,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:38,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:43:38,838 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:38,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1884311870, now seen corresponding path program 2 times [2023-11-23 21:43:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560950246] [2023-11-23 21:43:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:43:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560950246] [2023-11-23 21:43:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560950246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:43:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421566978] [2023-11-23 21:43:39,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 21:43:39,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:43:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:39,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:43:39,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:43:39,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 21:43:39,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:43:39,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 21:43:39,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:43:39,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421566978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 21:43:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-23 21:43:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610394337] [2023-11-23 21:43:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:39,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:43:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:43:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:43:39,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2023-11-23 21:43:39,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-23 21:43:39,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:39,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2023-11-23 21:43:39,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:42,635 INFO L124 PetriNetUnfolderBase]: 15390/22411 cut-off events. [2023-11-23 21:43:42,635 INFO L125 PetriNetUnfolderBase]: For 37243/38567 co-relation queries the response was YES. [2023-11-23 21:43:42,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74857 conditions, 22411 events. 15390/22411 cut-off events. For 37243/38567 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 150369 event pairs, 1757 based on Foata normal form. 693/22813 useless extension candidates. Maximal degree in co-relation 74824. Up to 7395 conditions per place. [2023-11-23 21:43:42,832 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 126 selfloop transitions, 17 changer transitions 0/164 dead transitions. [2023-11-23 21:43:42,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 1044 flow [2023-11-23 21:43:42,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2023-11-23 21:43:42,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2023-11-23 21:43:42,834 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 208 transitions. [2023-11-23 21:43:42,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 208 transitions. [2023-11-23 21:43:42,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:42,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 208 transitions. [2023-11-23 21:43:42,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 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-23 21:43:42,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:42,837 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:42,837 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 346 flow. Second operand 6 states and 208 transitions. [2023-11-23 21:43:42,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 164 transitions, 1044 flow [2023-11-23 21:43:42,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 164 transitions, 1017 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-23 21:43:42,947 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 475 flow [2023-11-23 21:43:42,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=475, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2023-11-23 21:43:42,948 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 36 predicate places. [2023-11-23 21:43:42,948 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 475 flow [2023-11-23 21:43:42,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-23 21:43:42,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:42,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:42,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 21:43:43,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:43:43,151 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:43,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1571770020, now seen corresponding path program 2 times [2023-11-23 21:43:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925612758] [2023-11-23 21:43:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:43:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925612758] [2023-11-23 21:43:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925612758] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:43:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581613766] [2023-11-23 21:43:43,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 21:43:43,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:43:43,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:43,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:43:43,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 21:43:43,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 21:43:43,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:43:43,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 21:43:43,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:43:43,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581613766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:43,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 21:43:43,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-23 21:43:43,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875056721] [2023-11-23 21:43:43,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:43,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:43:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:43,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:43:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:43:43,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2023-11-23 21:43:43,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 475 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-23 21:43:43,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:43,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2023-11-23 21:43:43,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:50,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), 54#L104true, Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, 43#L149-2true, 215#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), Black: 114#(= ~i~0 0), 13#L83true, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 140#true]) [2023-11-23 21:43:50,534 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-23 21:43:50,534 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-23 21:43:50,535 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 21:43:50,535 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-23 21:43:50,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), 54#L104true, Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 7#L150-1true, Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, 215#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), Black: 114#(= ~i~0 0), 13#L83true, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 140#true]) [2023-11-23 21:43:50,807 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-23 21:43:50,808 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-23 21:43:50,808 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 21:43:50,808 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-23 21:43:50,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), 50#L149-1true, Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#thread3EXITtrue, 23#L60true, Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), Black: 114#(= ~i~0 0), 13#L83true, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:50,838 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-23 21:43:50,839 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-23 21:43:50,839 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-23 21:43:50,839 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 21:43:50,901 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 42#thread2EXITtrue, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), 54#L104true, Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, 43#L149-2true, 215#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 140#true]) [2023-11-23 21:43:50,901 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-23 21:43:50,901 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-23 21:43:50,901 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-23 21:43:50,901 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-23 21:43:50,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 42#thread2EXITtrue, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), 47#L148-4true, Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#thread3EXITtrue, 23#L60true, Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:50,929 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-23 21:43:50,929 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 21:43:50,929 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-23 21:43:50,930 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-23 21:43:50,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 42#thread2EXITtrue, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), 54#L104true, Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 7#L150-1true, Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, 215#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 140#true]) [2023-11-23 21:43:50,987 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-23 21:43:50,987 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-23 21:43:50,988 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-23 21:43:50,988 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-23 21:43:51,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), 50#L149-1true, Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#thread3EXITtrue, Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), Black: 114#(= ~i~0 0), 11#thread1EXITtrue, 13#L83true, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,006 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-23 21:43:51,006 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-23 21:43:51,006 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-23 21:43:51,006 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 21:43:51,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 42#thread2EXITtrue, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), 50#L149-1true, Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#thread3EXITtrue, 23#L60true, Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,011 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-23 21:43:51,011 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-23 21:43:51,011 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 21:43:51,011 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-23 21:43:51,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 215#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 101#(= ~j~0 0), Black: 767#(<= ~q2_front~0 ~q2_back~0), 54#L104true, Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 17#L150-2true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 140#true]) [2023-11-23 21:43:51,046 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-23 21:43:51,046 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 21:43:51,047 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-23 21:43:51,047 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-23 21:43:51,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L119true, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), 43#L149-2true, Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 101#(= ~j~0 0), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 114#(= ~i~0 0), 13#L83true, 19#thread3EXITtrue, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,063 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-23 21:43:51,063 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-23 21:43:51,063 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-23 21:43:51,064 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-23 21:43:51,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 42#thread2EXITtrue, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), 47#L148-4true, Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#thread3EXITtrue, Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 11#thread1EXITtrue, Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,065 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-23 21:43:51,065 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-23 21:43:51,065 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-23 21:43:51,065 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-23 21:43:51,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), 32#L151-1true, Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 215#(= |thread3Thread1of1ForFork1_~cond~2#1| 1), Black: 101#(= ~j~0 0), Black: 767#(<= ~q2_front~0 ~q2_back~0), 54#L104true, Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 140#true]) [2023-11-23 21:43:51,085 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-23 21:43:51,085 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-23 21:43:51,085 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-23 21:43:51,085 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-23 21:43:51,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 42#thread2EXITtrue, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), 50#L149-1true, Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#thread3EXITtrue, Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 26#L119true, Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 11#thread1EXITtrue, Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,091 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-23 21:43:51,091 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-23 21:43:51,091 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-23 21:43:51,091 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-23 21:43:51,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 26#L119true, Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 7#L150-1true, Black: 114#(= ~i~0 0), 13#L83true, 19#thread3EXITtrue, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,093 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-23 21:43:51,093 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-23 21:43:51,093 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-23 21:43:51,093 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-23 21:43:51,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 42#thread2EXITtrue, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 26#L119true, Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), 43#L149-2true, Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 114#(= ~i~0 0), 19#thread3EXITtrue, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,113 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-23 21:43:51,113 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-11-23 21:43:51,114 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-23 21:43:51,114 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-11-23 21:43:51,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 42#thread2EXITtrue, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 26#L119true, Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 101#(= ~j~0 0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 7#L150-1true, Black: 114#(= ~i~0 0), 19#thread3EXITtrue, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,123 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-23 21:43:51,123 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-23 21:43:51,124 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-23 21:43:51,124 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-23 21:43:51,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 26#L119true, Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 17#L150-2true, 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 114#(= ~i~0 0), 19#thread3EXITtrue, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,130 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-23 21:43:51,130 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-23 21:43:51,130 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-23 21:43:51,130 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-23 21:43:51,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 26#L119true, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 66#(= ~total~0 0), 32#L151-1true, Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 101#(= ~j~0 0), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 114#(= ~i~0 0), 19#thread3EXITtrue, 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,133 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-23 21:43:51,133 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-23 21:43:51,133 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-11-23 21:43:51,133 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-23 21:43:51,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 26#L119true, 20#L151-2true, Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,136 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-11-23 21:43:51,137 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-23 21:43:51,137 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-23 21:43:51,137 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-23 21:43:51,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1034] L115-->L119: Formula: (and (not (= (ite (or (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| v_~total~0_96) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483647)) 1 0) 0)) (not (= 0 (ite (and (< v_~q2_front~0_115 v_~q2_back~0_115) (<= 0 v_~q2_front~0_115) (< v_~q2_front~0_115 v_~n2~0_70)) 1 0))) (not (= (ite (or (<= v_~total~0_96 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_95 |v_thread4Thread1of1ForFork3_plus_#res#1_1|) (= |v_thread4Thread1of1ForFork3_plus_#res#1_1| (+ (select (select |v_#memory_int#5_100| v_~q2~0.base_111) (+ v_~q2~0.offset_111 (* v_~q2_front~0_115 4))) v_~total~0_96)) (<= v_~total~0_95 2147483647) (<= 0 (+ v_~total~0_95 2147483648)) (= v_~q2_front~0_114 (+ v_~q2_front~0_115 1))) InVars {~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_115, ~q2~0.base=v_~q2~0.base_111, ~q2_back~0=v_~q2_back~0_115, ~total~0=v_~total~0_96} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~n2~0=v_~n2~0_70, ~q2~0.offset=v_~q2~0.offset_111, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_1|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, #memory_int#5=|v_#memory_int#5_100|, ~q2_front~0=v_~q2_front~0_114, thread4Thread1of1ForFork3_#t~post15#1=|v_thread4Thread1of1ForFork3_#t~post15#1_1|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_1|, ~total~0=v_~total~0_95, thread4Thread1of1ForFork3_#t~mem13#1=|v_thread4Thread1of1ForFork3_#t~mem13#1_1|, thread4Thread1of1ForFork3_#t~ret14#1=|v_thread4Thread1of1ForFork3_#t~ret14#1_1|, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_1|, ~q2~0.base=v_~q2~0.base_111, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_1|, ~q2_back~0=v_~q2_back~0_115, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_1|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#t~mem13#1, thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_#t~ret14#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~post15#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1][135], [Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 381#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)), 9#L152-1true, Black: 129#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 26#L119true, Black: 66#(= ~total~0 0), Black: 71#(<= ~q1_back~0 ~q1_front~0), Black: 137#(and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 767#(<= ~q2_front~0 ~q2_back~0), Black: 101#(= ~j~0 0), Black: 102#(and (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 905#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1)), Black: 76#(= ~q2_back~0 ~q2_front~0), Black: 761#(<= (+ 1 ~q2_front~0) ~q2_back~0), 140#true, Black: 449#true, Black: 684#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork3_~cond~3#1| 256) 0) (< ~j~0 ~N~0)), 915#(<= ~q1_front~0 ~q1_back~0), 672#(< 0 (mod |thread4Thread1of1ForFork3_~cond~3#1| 256)), Black: 81#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 114#(= ~i~0 0), 907#(and (<= ~q2_front~0 ~q2_back~0) (= |thread4Thread1of1ForFork3_~cond~3#1| 1))]) [2023-11-23 21:43:51,139 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-11-23 21:43:51,140 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-23 21:43:51,140 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-23 21:43:51,140 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-23 21:43:51,141 INFO L124 PetriNetUnfolderBase]: 32944/49411 cut-off events. [2023-11-23 21:43:51,141 INFO L125 PetriNetUnfolderBase]: For 148127/151428 co-relation queries the response was YES. [2023-11-23 21:43:51,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180438 conditions, 49411 events. 32944/49411 cut-off events. For 148127/151428 co-relation queries the response was YES. Maximal size of possible extension queue 2083. Compared 374715 event pairs, 4272 based on Foata normal form. 2676/51283 useless extension candidates. Maximal degree in co-relation 180401. Up to 14564 conditions per place. [2023-11-23 21:43:51,625 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 151 selfloop transitions, 17 changer transitions 0/194 dead transitions. [2023-11-23 21:43:51,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1451 flow [2023-11-23 21:43:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2023-11-23 21:43:51,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2023-11-23 21:43:51,627 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 210 transitions. [2023-11-23 21:43:51,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 210 transitions. [2023-11-23 21:43:51,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:51,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 210 transitions. [2023-11-23 21:43:51,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 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-23 21:43:51,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:51,630 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 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-23 21:43:51,631 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 475 flow. Second operand 6 states and 210 transitions. [2023-11-23 21:43:51,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1451 flow [2023-11-23 21:43:51,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 194 transitions, 1442 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-23 21:43:51,873 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 619 flow [2023-11-23 21:43:51,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2023-11-23 21:43:51,874 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 44 predicate places. [2023-11-23 21:43:51,875 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 619 flow [2023-11-23 21:43:51,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 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-23 21:43:51,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:51,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:51,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:52,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 21:43:52,097 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-23 21:43:52,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:52,098 INFO L85 PathProgramCache]: Analyzing trace with hash 351384851, now seen corresponding path program 1 times [2023-11-23 21:43:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:52,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787076353] [2023-11-23 21:43:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:43:56,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:56,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787076353] [2023-11-23 21:43:56,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787076353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:43:56,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060817691] [2023-11-23 21:43:56,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:56,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:43:56,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:56,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:43:57,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7810092e-18f3-4929-933c-a5865bc70522/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 21:43:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:57,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-23 21:43:57,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:57,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:43:57,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-23 21:43:57,480 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:43:57,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 21:43:57,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1