./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-send-receive.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_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/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_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/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_db03c42b-6282-45f7-adea-260afabecd75/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 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:28:39,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:28:39,297 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:28:39,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:28:39,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:28:39,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:28:39,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:28:39,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:28:39,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:28:39,362 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:28:39,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:28:39,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:28:39,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:28:39,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:28:39,366 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:28:39,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:28:39,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:28:39,368 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:28:39,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:28:39,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:28:39,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:28:39,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:28:39,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:28:39,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:28:39,372 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:28:39,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:28:39,373 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:28:39,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:28:39,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:28:39,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:28:39,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:28:39,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:28:39,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:28:39,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:28:39,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:28:39,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:28:39,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:28:39,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:28:39,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:28:39,379 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:28:39,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:28:39,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:28:39,380 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_db03c42b-6282-45f7-adea-260afabecd75/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_db03c42b-6282-45f7-adea-260afabecd75/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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2023-11-23 22:28:39,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:28:39,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:28:39,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:28:39,789 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:28:39,790 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:28:39,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2023-11-23 22:28:43,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:28:43,470 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:28:43,470 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2023-11-23 22:28:43,480 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/data/03cd97844/cde1607bd5b34fd8b858af4243f9c16f/FLAGd400b015f [2023-11-23 22:28:43,497 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/data/03cd97844/cde1607bd5b34fd8b858af4243f9c16f [2023-11-23 22:28:43,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:28:43,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:28:43,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:28:43,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:28:43,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:28:43,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57525fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43, skipping insertion in model container [2023-11-23 22:28:43,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:28:43,806 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_db03c42b-6282-45f7-adea-260afabecd75/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3146,3159] [2023-11-23 22:28:43,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:28:43,830 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:28:43,861 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_db03c42b-6282-45f7-adea-260afabecd75/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3146,3159] [2023-11-23 22:28:43,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:28:43,875 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:43,875 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:43,885 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:28:43,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43 WrapperNode [2023-11-23 22:28:43,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:28:43,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:28:43,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:28:43,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:28:43,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,936 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 166 [2023-11-23 22:28:43,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:28:43,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:28:43,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:28:43,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:28:43,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,956 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,972 INFO L189 HeapSplitter]: Split 12 memory accesses to 5 slices as follows [2, 2, 4, 2, 2] [2023-11-23 22:28:43,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,986 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:43,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:28:43,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:28:43,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:28:43,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:28:43,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (1/1) ... [2023-11-23 22:28:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:28:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:28:44,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:28:44,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:28:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:28:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:28:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 22:28:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 22:28:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 22:28:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 22:28:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 22:28:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 22:28:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 22:28:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 22:28:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 22:28:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 22:28:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-23 22:28:44,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-23 22:28:44,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-23 22:28:44,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-23 22:28:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-23 22:28:44,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-23 22:28:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:28:44,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 22:28:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 22:28:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 22:28:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 22:28:44,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 22:28:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 22:28:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 22:28:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:28:44,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:28:44,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:28:44,079 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 22:28:44,228 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:28:44,231 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:28:44,598 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:28:44,872 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:28:44,873 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 22:28:44,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:44 BoogieIcfgContainer [2023-11-23 22:28:44,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:28:44,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:28:44,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:28:44,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:28:44,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:28:43" (1/3) ... [2023-11-23 22:28:44,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3198530d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:44, skipping insertion in model container [2023-11-23 22:28:44,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:43" (2/3) ... [2023-11-23 22:28:44,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3198530d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:28:44, skipping insertion in model container [2023-11-23 22:28:44,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:28:44" (3/3) ... [2023-11-23 22:28:44,882 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-11-23 22:28:44,891 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-23 22:28:44,902 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:28:44,902 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:28:44,902 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 22:28:44,955 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-23 22:28:44,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 99 flow [2023-11-23 22:28:45,027 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-11-23 22:28:45,027 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-23 22:28:45,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2023-11-23 22:28:45,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 99 flow [2023-11-23 22:28:45,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2023-11-23 22:28:45,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:28:45,056 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;@6ed8a818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:28:45,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-23 22:28:45,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:28:45,071 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2023-11-23 22:28:45,071 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-23 22:28:45,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:28:45,072 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] [2023-11-23 22:28:45,073 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 1 more)] === [2023-11-23 22:28:45,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash -779910303, now seen corresponding path program 1 times [2023-11-23 22:28:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274008395] [2023-11-23 22:28:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:45,791 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 22:28:45,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:45,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274008395] [2023-11-23 22:28:45,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274008395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:28:45,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:28:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:28:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389986756] [2023-11-23 22:28:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:28:45,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:28:45,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:45,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:28:45,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:28:45,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-23 22:28:45,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 22:28:45,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:28:45,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-23 22:28:45,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:28:46,251 INFO L124 PetriNetUnfolderBase]: 583/994 cut-off events. [2023-11-23 22:28:46,253 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-23 22:28:46,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 994 events. 583/994 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4883 event pairs, 38 based on Foata normal form. 104/1031 useless extension candidates. Maximal degree in co-relation 1861. Up to 280 conditions per place. [2023-11-23 22:28:46,278 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 63 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2023-11-23 22:28:46,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 322 flow [2023-11-23 22:28:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:28:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 22:28:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2023-11-23 22:28:46,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6367521367521367 [2023-11-23 22:28:46,299 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 149 transitions. [2023-11-23 22:28:46,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 149 transitions. [2023-11-23 22:28:46,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:28:46,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 149 transitions. [2023-11-23 22:28:46,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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 22:28:46,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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 22:28:46,314 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 39.0) internal successors, (273), 7 states have internal predecessors, (273), 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 22:28:46,317 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 88 flow. Second operand 6 states and 149 transitions. [2023-11-23 22:28:46,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 322 flow [2023-11-23 22:28:46,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 78 transitions, 302 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-23 22:28:46,329 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 110 flow [2023-11-23 22:28:46,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-11-23 22:28:46,343 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-11-23 22:28:46,343 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 110 flow [2023-11-23 22:28:46,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 22:28:46,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:28:46,344 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] [2023-11-23 22:28:46,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:28:46,345 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 1 more)] === [2023-11-23 22:28:46,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1650889046, now seen corresponding path program 1 times [2023-11-23 22:28:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:46,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098790144] [2023-11-23 22:28:46,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:46,572 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 22:28:46,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:46,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098790144] [2023-11-23 22:28:46,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098790144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:28:46,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:28:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:28:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858389109] [2023-11-23 22:28:46,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:28:46,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:28:46,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:28:46,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:28:46,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2023-11-23 22:28:46,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 22:28:46,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:28:46,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2023-11-23 22:28:46,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:28:46,768 INFO L124 PetriNetUnfolderBase]: 247/482 cut-off events. [2023-11-23 22:28:46,769 INFO L125 PetriNetUnfolderBase]: For 543/637 co-relation queries the response was YES. [2023-11-23 22:28:46,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 482 events. 247/482 cut-off events. For 543/637 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2208 event pairs, 87 based on Foata normal form. 110/523 useless extension candidates. Maximal degree in co-relation 462. Up to 317 conditions per place. [2023-11-23 22:28:46,776 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 26 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2023-11-23 22:28:46,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2023-11-23 22:28:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:28:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:28:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2023-11-23 22:28:46,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2023-11-23 22:28:46,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 79 transitions. [2023-11-23 22:28:46,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 79 transitions. [2023-11-23 22:28:46,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:28:46,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 79 transitions. [2023-11-23 22:28:46,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 22:28:46,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:28:46,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:28:46,796 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 110 flow. Second operand 3 states and 79 transitions. [2023-11-23 22:28:46,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2023-11-23 22:28:46,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:28:46,801 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 125 flow [2023-11-23 22:28:46,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2023-11-23 22:28:46,803 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-11-23 22:28:46,803 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 125 flow [2023-11-23 22:28:46,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 22:28:46,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:28:46,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:28:46,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:28:46,805 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 1 more)] === [2023-11-23 22:28:46,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash -772483127, now seen corresponding path program 1 times [2023-11-23 22:28:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:46,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083595126] [2023-11-23 22:28:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:47,083 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 22:28:47,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:47,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083595126] [2023-11-23 22:28:47,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083595126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:28:47,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:28:47,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:28:47,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575906205] [2023-11-23 22:28:47,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:28:47,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:28:47,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:47,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:28:47,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:28:47,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2023-11-23 22:28:47,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 22:28:47,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:28:47,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2023-11-23 22:28:47,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:28:47,289 INFO L124 PetriNetUnfolderBase]: 260/507 cut-off events. [2023-11-23 22:28:47,289 INFO L125 PetriNetUnfolderBase]: For 687/822 co-relation queries the response was YES. [2023-11-23 22:28:47,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 507 events. 260/507 cut-off events. For 687/822 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2323 event pairs, 157 based on Foata normal form. 125/556 useless extension candidates. Maximal degree in co-relation 972. Up to 365 conditions per place. [2023-11-23 22:28:47,296 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 24 selfloop transitions, 2 changer transitions 10/51 dead transitions. [2023-11-23 22:28:47,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 222 flow [2023-11-23 22:28:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:28:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:28:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2023-11-23 22:28:47,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2023-11-23 22:28:47,303 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 98 transitions. [2023-11-23 22:28:47,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 98 transitions. [2023-11-23 22:28:47,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:28:47,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 98 transitions. [2023-11-23 22:28:47,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 22:28:47,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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 22:28:47,311 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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 22:28:47,311 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 125 flow. Second operand 4 states and 98 transitions. [2023-11-23 22:28:47,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 222 flow [2023-11-23 22:28:47,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:28:47,320 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 136 flow [2023-11-23 22:28:47,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-11-23 22:28:47,321 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-11-23 22:28:47,322 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 136 flow [2023-11-23 22:28:47,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 22:28:47,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:28:47,323 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 22:28:47,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:28:47,323 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 1 more)] === [2023-11-23 22:28:47,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:47,324 INFO L85 PathProgramCache]: Analyzing trace with hash -425765083, now seen corresponding path program 1 times [2023-11-23 22:28:47,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188755827] [2023-11-23 22:28:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 22:28:47,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188755827] [2023-11-23 22:28:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188755827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:28:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235727697] [2023-11-23 22:28:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:47,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:28:47,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:28:47,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:28:47,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:28:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:47,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 22:28:47,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:28:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 22:28:47,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:28:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 22:28:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235727697] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:28:47,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:28:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 7 [2023-11-23 22:28:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838233085] [2023-11-23 22:28:47,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:28:47,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:28:47,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:47,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:28:47,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:28:48,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2023-11-23 22:28:48,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 136 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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 22:28:48,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:28:48,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2023-11-23 22:28:48,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:28:48,556 INFO L124 PetriNetUnfolderBase]: 1093/1765 cut-off events. [2023-11-23 22:28:48,556 INFO L125 PetriNetUnfolderBase]: For 1955/2263 co-relation queries the response was YES. [2023-11-23 22:28:48,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 1765 events. 1093/1765 cut-off events. For 1955/2263 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8942 event pairs, 122 based on Foata normal form. 352/2005 useless extension candidates. Maximal degree in co-relation 4520. Up to 540 conditions per place. [2023-11-23 22:28:48,575 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 76 selfloop transitions, 13 changer transitions 15/112 dead transitions. [2023-11-23 22:28:48,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 597 flow [2023-11-23 22:28:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 22:28:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-23 22:28:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2023-11-23 22:28:48,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49743589743589745 [2023-11-23 22:28:48,578 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 194 transitions. [2023-11-23 22:28:48,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 194 transitions. [2023-11-23 22:28:48,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:28:48,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 194 transitions. [2023-11-23 22:28:48,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 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 22:28:48,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 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 22:28:48,582 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 39.0) internal successors, (429), 11 states have internal predecessors, (429), 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 22:28:48,582 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 136 flow. Second operand 10 states and 194 transitions. [2023-11-23 22:28:48,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 597 flow [2023-11-23 22:28:48,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 112 transitions, 585 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-23 22:28:48,591 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 206 flow [2023-11-23 22:28:48,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=206, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-11-23 22:28:48,593 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-11-23 22:28:48,593 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 206 flow [2023-11-23 22:28:48,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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 22:28:48,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:28:48,594 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 22:28:48,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:28:48,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:28:48,819 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 1 more)] === [2023-11-23 22:28:48,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:28:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1037776093, now seen corresponding path program 2 times [2023-11-23 22:28:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:28:48,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571409615] [2023-11-23 22:28:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:28:48,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:28:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:28:50,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:50,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571409615] [2023-11-23 22:28:50,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571409615] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:28:50,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997325536] [2023-11-23 22:28:50,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 22:28:50,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:28:50,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:28:50,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:28:50,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:28:50,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 22:28:50,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:28:50,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-23 22:28:50,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:28:50,373 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 22:28:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:28:50,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:28:51,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2023-11-23 22:28:51,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:28:51,514 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 78 treesize of output 68 [2023-11-23 22:28:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:28:51,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997325536] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:28:51,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:28:51,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2023-11-23 22:28:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070255711] [2023-11-23 22:28:51,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:28:51,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-23 22:28:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:28:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 22:28:51,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2023-11-23 22:28:51,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2023-11-23 22:28:51,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 206 flow. Second operand has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 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 22:28:51,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:28:51,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2023-11-23 22:28:51,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:00,950 INFO L124 PetriNetUnfolderBase]: 12167/18444 cut-off events. [2023-11-23 22:29:00,950 INFO L125 PetriNetUnfolderBase]: For 17588/17838 co-relation queries the response was YES. [2023-11-23 22:29:01,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52231 conditions, 18444 events. 12167/18444 cut-off events. For 17588/17838 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 114321 event pairs, 806 based on Foata normal form. 1250/19616 useless extension candidates. Maximal degree in co-relation 38362. Up to 2520 conditions per place. [2023-11-23 22:29:01,136 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 492 selfloop transitions, 163 changer transitions 126/789 dead transitions. [2023-11-23 22:29:01,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 789 transitions, 4695 flow [2023-11-23 22:29:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-11-23 22:29:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2023-11-23 22:29:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 1333 transitions. [2023-11-23 22:29:01,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47471509971509973 [2023-11-23 22:29:01,146 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 1333 transitions. [2023-11-23 22:29:01,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 1333 transitions. [2023-11-23 22:29:01,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:01,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 1333 transitions. [2023-11-23 22:29:01,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 18.51388888888889) internal successors, (1333), 72 states have internal predecessors, (1333), 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 22:29:01,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 39.0) internal successors, (2847), 73 states have internal predecessors, (2847), 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 22:29:01,164 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 39.0) internal successors, (2847), 73 states have internal predecessors, (2847), 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 22:29:01,165 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 206 flow. Second operand 72 states and 1333 transitions. [2023-11-23 22:29:01,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 789 transitions, 4695 flow [2023-11-23 22:29:01,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 789 transitions, 4677 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:01,382 INFO L231 Difference]: Finished difference. Result has 180 places, 239 transitions, 1851 flow [2023-11-23 22:29:01,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=1851, PETRI_PLACES=180, PETRI_TRANSITIONS=239} [2023-11-23 22:29:01,384 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 139 predicate places. [2023-11-23 22:29:01,384 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 239 transitions, 1851 flow [2023-11-23 22:29:01,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 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 22:29:01,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:01,385 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:29:01,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:29:01,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:01,597 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 1 more)] === [2023-11-23 22:29:01,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash 903165389, now seen corresponding path program 3 times [2023-11-23 22:29:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826387799] [2023-11-23 22:29:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:29:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826387799] [2023-11-23 22:29:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826387799] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639558375] [2023-11-23 22:29:03,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 22:29:03,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:03,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:03,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:29:03,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 22:29:03,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-23 22:29:03,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:29:03,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-23 22:29:03,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:29:03,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:29:03,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:29:03,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 24 [2023-11-23 22:29:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:29:03,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639558375] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:29:03,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:29:03,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2023-11-23 22:29:03,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805422669] [2023-11-23 22:29:03,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:29:03,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-23 22:29:03,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:03,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-23 22:29:03,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2023-11-23 22:29:04,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2023-11-23 22:29:04,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 239 transitions, 1851 flow. Second operand has 22 states, 22 states have (on average 13.0) internal successors, (286), 22 states have internal predecessors, (286), 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 22:29:04,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:04,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2023-11-23 22:29:04,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:08,687 INFO L124 PetriNetUnfolderBase]: 6638/10846 cut-off events. [2023-11-23 22:29:08,688 INFO L125 PetriNetUnfolderBase]: For 211781/212464 co-relation queries the response was YES. [2023-11-23 22:29:08,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60323 conditions, 10846 events. 6638/10846 cut-off events. For 211781/212464 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 70441 event pairs, 540 based on Foata normal form. 431/10911 useless extension candidates. Maximal degree in co-relation 50946. Up to 2006 conditions per place. [2023-11-23 22:29:08,904 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 220 selfloop transitions, 175 changer transitions 65/506 dead transitions. [2023-11-23 22:29:08,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 506 transitions, 4908 flow [2023-11-23 22:29:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 22:29:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-23 22:29:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 431 transitions. [2023-11-23 22:29:08,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.442051282051282 [2023-11-23 22:29:08,909 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 431 transitions. [2023-11-23 22:29:08,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 431 transitions. [2023-11-23 22:29:08,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:08,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 431 transitions. [2023-11-23 22:29:08,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 17.24) internal successors, (431), 25 states have internal predecessors, (431), 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 22:29:08,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 39.0) internal successors, (1014), 26 states have internal predecessors, (1014), 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 22:29:08,915 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 39.0) internal successors, (1014), 26 states have internal predecessors, (1014), 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 22:29:08,915 INFO L175 Difference]: Start difference. First operand has 180 places, 239 transitions, 1851 flow. Second operand 25 states and 431 transitions. [2023-11-23 22:29:08,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 506 transitions, 4908 flow [2023-11-23 22:29:09,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 506 transitions, 4328 flow, removed 248 selfloop flow, removed 11 redundant places. [2023-11-23 22:29:09,813 INFO L231 Difference]: Finished difference. Result has 199 places, 303 transitions, 2604 flow [2023-11-23 22:29:09,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1600, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2604, PETRI_PLACES=199, PETRI_TRANSITIONS=303} [2023-11-23 22:29:09,818 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 158 predicate places. [2023-11-23 22:29:09,818 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 303 transitions, 2604 flow [2023-11-23 22:29:09,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.0) internal successors, (286), 22 states have internal predecessors, (286), 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 22:29:09,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:09,819 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 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 22:29:09,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 22:29:10,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:10,028 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 1 more)] === [2023-11-23 22:29:10,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash 304953792, now seen corresponding path program 4 times [2023-11-23 22:29:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:10,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276226534] [2023-11-23 22:29:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:29:10,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276226534] [2023-11-23 22:29:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276226534] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045804418] [2023-11-23 22:29:10,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 22:29:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:10,319 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:29:10,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 22:29:10,453 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 22:29:10,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:29:10,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 22:29:10,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 22:29:10,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:10,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045804418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:10,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:29:10,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-23 22:29:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320407819] [2023-11-23 22:29:10,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:10,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:29:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:10,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:29:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:29:10,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2023-11-23 22:29:10,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 303 transitions, 2604 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 22:29:10,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:10,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2023-11-23 22:29:10,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:12,119 INFO L124 PetriNetUnfolderBase]: 3064/5728 cut-off events. [2023-11-23 22:29:12,119 INFO L125 PetriNetUnfolderBase]: For 124632/125228 co-relation queries the response was YES. [2023-11-23 22:29:12,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37038 conditions, 5728 events. 3064/5728 cut-off events. For 124632/125228 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 39871 event pairs, 869 based on Foata normal form. 566/5738 useless extension candidates. Maximal degree in co-relation 30596. Up to 1756 conditions per place. [2023-11-23 22:29:12,354 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 117 selfloop transitions, 85 changer transitions 0/276 dead transitions. [2023-11-23 22:29:12,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 276 transitions, 2835 flow [2023-11-23 22:29:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2023-11-23 22:29:12,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2023-11-23 22:29:12,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 116 transitions. [2023-11-23 22:29:12,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 116 transitions. [2023-11-23 22:29:12,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:12,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 116 transitions. [2023-11-23 22:29:12,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:12,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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 22:29:12,361 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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 22:29:12,362 INFO L175 Difference]: Start difference. First operand has 199 places, 303 transitions, 2604 flow. Second operand 4 states and 116 transitions. [2023-11-23 22:29:12,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 276 transitions, 2835 flow [2023-11-23 22:29:12,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 276 transitions, 2561 flow, removed 96 selfloop flow, removed 21 redundant places. [2023-11-23 22:29:12,629 INFO L231 Difference]: Finished difference. Result has 165 places, 250 transitions, 2401 flow [2023-11-23 22:29:12,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2401, PETRI_PLACES=165, PETRI_TRANSITIONS=250} [2023-11-23 22:29:12,630 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 124 predicate places. [2023-11-23 22:29:12,630 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 250 transitions, 2401 flow [2023-11-23 22:29:12,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 22:29:12,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:12,631 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 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 22:29:12,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 22:29:12,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:12,854 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 1 more)] === [2023-11-23 22:29:12,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:12,855 INFO L85 PathProgramCache]: Analyzing trace with hash -946870677, now seen corresponding path program 5 times [2023-11-23 22:29:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:12,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023205449] [2023-11-23 22:29:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:12,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 22:29:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023205449] [2023-11-23 22:29:13,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023205449] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:13,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905787371] [2023-11-23 22:29:13,125 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-23 22:29:13,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:13,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:13,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:29:13,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 22:29:13,245 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-23 22:29:13,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:29:13,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 22:29:13,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 22:29:13,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905787371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:13,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 22:29:13,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-23 22:29:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934078703] [2023-11-23 22:29:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:13,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:29:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:29:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:29:13,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2023-11-23 22:29:13,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 250 transitions, 2401 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 22:29:13,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:13,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2023-11-23 22:29:13,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:15,125 INFO L124 PetriNetUnfolderBase]: 4507/8053 cut-off events. [2023-11-23 22:29:15,125 INFO L125 PetriNetUnfolderBase]: For 110117/110935 co-relation queries the response was YES. [2023-11-23 22:29:15,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44907 conditions, 8053 events. 4507/8053 cut-off events. For 110117/110935 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 54167 event pairs, 1284 based on Foata normal form. 812/8359 useless extension candidates. Maximal degree in co-relation 38912. Up to 3442 conditions per place. [2023-11-23 22:29:15,230 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 196 selfloop transitions, 14 changer transitions 3/248 dead transitions. [2023-11-23 22:29:15,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 248 transitions, 2795 flow [2023-11-23 22:29:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2023-11-23 22:29:15,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2023-11-23 22:29:15,232 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 96 transitions. [2023-11-23 22:29:15,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 96 transitions. [2023-11-23 22:29:15,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:15,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 96 transitions. [2023-11-23 22:29:15,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 22:29:15,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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 22:29:15,233 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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 22:29:15,234 INFO L175 Difference]: Start difference. First operand has 165 places, 250 transitions, 2401 flow. Second operand 4 states and 96 transitions. [2023-11-23 22:29:15,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 248 transitions, 2795 flow [2023-11-23 22:29:15,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 248 transitions, 2745 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-11-23 22:29:15,688 INFO L231 Difference]: Finished difference. Result has 160 places, 213 transitions, 2080 flow [2023-11-23 22:29:15,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2080, PETRI_PLACES=160, PETRI_TRANSITIONS=213} [2023-11-23 22:29:15,689 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 119 predicate places. [2023-11-23 22:29:15,689 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 213 transitions, 2080 flow [2023-11-23 22:29:15,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 22:29:15,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:15,690 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 22:29:15,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 22:29:15,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:15,905 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 1 more)] === [2023-11-23 22:29:15,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash -393476175, now seen corresponding path program 1 times [2023-11-23 22:29:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633944815] [2023-11-23 22:29:15,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 22:29:16,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633944815] [2023-11-23 22:29:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633944815] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778959459] [2023-11-23 22:29:16,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:16,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:16,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:29:16,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 22:29:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:16,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 22:29:16,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 22:29:16,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:29:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 22:29:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778959459] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:29:16,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:29:16,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-11-23 22:29:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492562241] [2023-11-23 22:29:16,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:29:16,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 22:29:16,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:16,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 22:29:16,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-11-23 22:29:16,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2023-11-23 22:29:16,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 213 transitions, 2080 flow. Second operand has 15 states, 15 states have (on average 18.533333333333335) internal successors, (278), 15 states have internal predecessors, (278), 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 22:29:16,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:16,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2023-11-23 22:29:16,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:17,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L52-->L56: Formula: (and (= (+ v_~front~0_69 1) v_~front~0_68) (= (+ (select (select |v_#memory_int#2_42| v_~queue~0.base_62) (+ (* v_~front~0_69 4) v_~queue~0.offset_62)) v_~sum~0_44) v_~sum~0_43) (not (= (ite (and (< v_~front~0_69 v_~n~0_52) (< v_~front~0_69 v_~back~0_83) (<= 0 v_~front~0_69)) 1 0) 0))) InVars {~sum~0=v_~sum~0_44, ~queue~0.offset=v_~queue~0.offset_62, ~back~0=v_~back~0_83, ~queue~0.base=v_~queue~0.base_62, #memory_int#2=|v_#memory_int#2_42|, ~n~0=v_~n~0_52, ~front~0=v_~front~0_69} OutVars{~sum~0=v_~sum~0_43, ~queue~0.offset=v_~queue~0.offset_62, thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~back~0=v_~back~0_83, ~queue~0.base=v_~queue~0.base_62, #memory_int#2=|v_#memory_int#2_42|, ~n~0=v_~n~0_52, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|, ~front~0=v_~front~0_68} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~mem1#1, ~front~0][130], [Black: 523#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 579#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 611#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 529#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 569#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 463#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 617#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 575#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 509#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 547#(and (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 531#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 553#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 75#true, Black: 278#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 290#true, Black: 595#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 282#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 591#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= ~v_assert~0 1)), Black: 276#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 517#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 280#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 525#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 589#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 565#(and (= ~back~0 0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 1)) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~front~0 1) (< ~n~0 2) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0)), Black: 535#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 559#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (and (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1)) (or (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 537#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 527#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 621#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 12#L84true, Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 982#(<= ~back~0 ~front~0), Black: 65#(= ~back~0 ~front~0), Black: 1034#(<= ~back~0 (+ ~front~0 1)), 20#L95true, 975#true, Black: 1144#(not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)), Black: 957#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 1151#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 953#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 961#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 949#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 935#(and (or (< ~back~0 3) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 963#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 959#(and (= ~v_assert~0 1) (= ~sum~0 0) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 22#L113-1true, 23#L56true, 437#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), 1224#true, 78#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), 782#(= |thread2Thread1of1ForFork0_~cond~1#1| 1)]) [2023-11-23 22:29:17,615 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-23 22:29:17,615 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 22:29:17,615 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-23 22:29:17,615 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-23 22:29:17,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= (ite (and (< v_~back~0_99 v_~n~0_56) (<= 0 v_~back~0_99)) 1 0) 0))) InVars {~back~0=v_~back~0_99, ~n~0=v_~n~0_56, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_99, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_56, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][128], [1144#(not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)), Black: 523#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 579#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 611#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), 373#(= |thread1Thread1of1ForFork2_~cond~0#1| 1), Black: 529#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 569#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 463#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 617#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 575#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 509#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 547#(and (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 531#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 553#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 75#true, Black: 290#true, Black: 278#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 282#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 595#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 78#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 591#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= ~v_assert~0 1)), Black: 276#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 517#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 280#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), 9#L72true, Black: 525#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 589#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 437#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), 6#L52true, Black: 565#(and (= ~back~0 0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 1)) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~front~0 1) (< ~n~0 2) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0)), Black: 535#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 559#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (and (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1)) (or (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 537#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 527#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 621#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 230#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 982#(<= ~back~0 ~front~0), Black: 1034#(<= ~back~0 (+ ~front~0 1)), Black: 65#(= ~back~0 ~front~0), 20#L95true, 975#true, Black: 1151#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 957#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 953#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 961#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 949#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 935#(and (or (< ~back~0 3) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 963#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 959#(and (= ~v_assert~0 1) (= ~sum~0 0) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 22#L113-1true, 1224#true]) [2023-11-23 22:29:17,754 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-23 22:29:17,754 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-23 22:29:17,754 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-23 22:29:17,754 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-23 22:29:17,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= (ite (and (< v_~back~0_99 v_~n~0_56) (<= 0 v_~back~0_99)) 1 0) 0))) InVars {~back~0=v_~back~0_99, ~n~0=v_~n~0_56, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_99, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_56, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][128], [1144#(not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)), Black: 523#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 579#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 611#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 529#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 569#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 463#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 617#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 575#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 509#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 547#(and (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 531#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 553#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 75#true, Black: 278#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 282#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 595#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 591#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= ~v_assert~0 1)), Black: 78#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 276#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 517#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 280#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 525#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), 9#L72true, 26#thread3EXITtrue, Black: 589#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 437#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 565#(and (= ~back~0 0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 1)) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~front~0 1) (< ~n~0 2) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0)), Black: 535#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 559#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (and (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1)) (or (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 537#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), 982#(<= ~back~0 ~front~0), Black: 527#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 621#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), 230#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 1034#(<= ~back~0 (+ ~front~0 1)), Black: 65#(= ~back~0 ~front~0), Black: 1151#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 957#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 953#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 961#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 290#true, Black: 949#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 935#(and (or (< ~back~0 3) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 963#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 959#(and (= ~v_assert~0 1) (= ~sum~0 0) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 22#L113-1true, 1224#true, 17#thread1EXITtrue]) [2023-11-23 22:29:17,908 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-23 22:29:17,908 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-11-23 22:29:17,908 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-23 22:29:17,908 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-23 22:29:17,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][129], [1144#(not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)), Black: 523#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 579#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 611#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 529#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 569#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 463#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 617#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 575#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 509#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 547#(and (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 531#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 553#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), 21#thread2EXITtrue, Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 278#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 282#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 595#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 591#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= ~v_assert~0 1)), Black: 78#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 276#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 517#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 280#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 525#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), 26#thread3EXITtrue, Black: 589#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 437#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 565#(and (= ~back~0 0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 1)) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~front~0 1) (< ~n~0 2) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0)), Black: 535#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 559#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (and (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1)) (or (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 537#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), 982#(<= ~back~0 ~front~0), Black: 527#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 621#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 1034#(<= ~back~0 (+ ~front~0 1)), Black: 65#(= ~back~0 ~front~0), Black: 1151#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 957#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 953#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 961#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 949#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 290#true, Black: 935#(and (or (< ~back~0 3) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 963#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 959#(and (= ~v_assert~0 1) (= ~sum~0 0) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 22#L113-1true, 1224#true, 692#true, 17#thread1EXITtrue]) [2023-11-23 22:29:17,908 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-23 22:29:17,908 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-11-23 22:29:17,908 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-23 22:29:17,909 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-23 22:29:17,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= (ite (and (< v_~back~0_99 v_~n~0_56) (<= 0 v_~back~0_99)) 1 0) 0))) InVars {~back~0=v_~back~0_99, ~n~0=v_~n~0_56, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_99, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_56, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][128], [1144#(not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)), Black: 523#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 579#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 611#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 529#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 569#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 463#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 617#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 575#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 509#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 547#(and (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 531#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 553#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 75#true, Black: 278#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 282#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 595#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 591#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= ~v_assert~0 1)), Black: 78#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 276#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 517#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 280#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), 9#L72true, Black: 525#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), 26#thread3EXITtrue, Black: 589#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 437#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 565#(and (= ~back~0 0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 1)) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~front~0 1) (< ~n~0 2) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0)), Black: 535#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 559#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (and (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1)) (or (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 537#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), 982#(<= ~back~0 ~front~0), Black: 527#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 621#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), 230#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 1034#(<= ~back~0 (+ ~front~0 1)), Black: 65#(= ~back~0 ~front~0), Black: 1151#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 957#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 953#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 961#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 290#true, Black: 949#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 935#(and (or (< ~back~0 3) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 963#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 959#(and (= ~v_assert~0 1) (= ~sum~0 0) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 19#L113-2true, 1224#true]) [2023-11-23 22:29:17,915 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-23 22:29:17,915 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:29:17,916 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-23 22:29:17,916 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:29:17,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][129], [1144#(not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)), Black: 523#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 579#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 611#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 529#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 569#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 463#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 617#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 575#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 509#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 547#(and (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 531#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 553#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), 21#thread2EXITtrue, Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 278#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 282#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 595#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 591#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= ~v_assert~0 1)), Black: 78#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 276#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 517#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 280#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 525#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), 26#thread3EXITtrue, Black: 589#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 437#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 565#(and (= ~back~0 0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 1)) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~front~0 1) (< ~n~0 2) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0)), Black: 535#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 559#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (and (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1)) (or (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 537#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), 982#(<= ~back~0 ~front~0), Black: 527#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 621#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 1034#(<= ~back~0 (+ ~front~0 1)), Black: 65#(= ~back~0 ~front~0), Black: 1151#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 957#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 953#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 961#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 949#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 290#true, Black: 935#(and (or (< ~back~0 3) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 963#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 959#(and (= ~v_assert~0 1) (= ~sum~0 0) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 19#L113-2true, 1224#true, 692#true]) [2023-11-23 22:29:17,917 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-23 22:29:17,917 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:29:17,917 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-23 22:29:17,917 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-23 22:29:17,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L86-->L72: Formula: (and (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) (not (= (ite (and (< v_~back~0_99 v_~n~0_56) (<= 0 v_~back~0_99)) 1 0) 0))) InVars {~back~0=v_~back~0_99, ~n~0=v_~n~0_56, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{~back~0=v_~back~0_99, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n~0=v_~n~0_56, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][128], [1144#(not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)), Black: 523#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 579#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 611#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 529#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 569#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 463#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 617#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 575#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 509#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 547#(and (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 531#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 553#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 75#true, Black: 278#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 282#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 595#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 591#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= ~v_assert~0 1)), Black: 78#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 276#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 517#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 280#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 525#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), 9#L72true, 26#thread3EXITtrue, Black: 589#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 437#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 565#(and (= ~back~0 0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 1)) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~front~0 1) (< ~n~0 2) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0)), Black: 535#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 559#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (and (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1)) (or (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 537#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), 982#(<= ~back~0 ~front~0), Black: 527#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 621#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 31#L114-1true, Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), 230#(< 0 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 1034#(<= ~back~0 (+ ~front~0 1)), Black: 65#(= ~back~0 ~front~0), Black: 1151#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 957#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 953#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 961#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 290#true, Black: 949#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 935#(and (or (< ~back~0 3) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 963#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 959#(and (= ~v_assert~0 1) (= ~sum~0 0) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 1224#true]) [2023-11-23 22:29:17,922 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-23 22:29:17,922 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-23 22:29:17,922 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:29:17,922 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:29:17,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L86-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_5| 256) 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_5|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset][129], [1144#(not (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0)), Black: 523#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 579#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 611#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0)))), Black: 529#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 569#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), Black: 463#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))), Black: 617#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 575#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 509#(or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 547#(and (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), Black: 531#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 553#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= (select (select |#memory_int#2| ~queue~0.base) 0) 1) (= ~front~0 0)), 21#thread2EXITtrue, Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), Black: 278#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 282#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 595#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 591#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= ~v_assert~0 1)), Black: 78#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 276#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 517#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 280#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 525#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1) (or (< ~back~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)))), 26#thread3EXITtrue, Black: 589#(and (or (and (or (= ~sum~0 0) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (or (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))) 1) (<= 0 (+ ~sum~0 (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4))))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1)))), Black: 437#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 565#(and (= ~back~0 0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 1)) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~front~0 1) (< ~n~0 2) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0)), Black: 535#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 559#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< ~n~0 (+ ~back~0 1)) (and (<= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1))) (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~back~0 4)) 1))) (= ~sum~0 1) (= ~v_assert~0 1) (or (and (not (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1)) (or (< ~front~0 1) (< ~n~0 2))) (not (= ~back~0 0)) (not (= (select (select |#memory_int#2| ~queue~0.base) 0) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)))), Black: 537#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), 982#(<= ~back~0 ~front~0), Black: 527#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 621#(and (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 31#L114-1true, Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 1034#(<= ~back~0 (+ ~front~0 1)), Black: 65#(= ~back~0 ~front~0), Black: 1151#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 957#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 953#(and (= (select (select |#memory_int#2| ~queue~0.base) (* ~front~0 4)) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 961#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 949#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 290#true, Black: 935#(and (or (< ~back~0 3) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1| 2))) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 963#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 959#(and (= ~v_assert~0 1) (= ~sum~0 0) (= (select (select |#memory_int#2| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 1224#true, 692#true]) [2023-11-23 22:29:17,923 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-23 22:29:17,923 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-23 22:29:17,923 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:29:17,923 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-23 22:29:17,930 INFO L124 PetriNetUnfolderBase]: 3383/6336 cut-off events. [2023-11-23 22:29:17,930 INFO L125 PetriNetUnfolderBase]: For 85366/85893 co-relation queries the response was YES. [2023-11-23 22:29:17,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36320 conditions, 6336 events. 3383/6336 cut-off events. For 85366/85893 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 44559 event pairs, 1812 based on Foata normal form. 327/5845 useless extension candidates. Maximal degree in co-relation 36267. Up to 4599 conditions per place. [2023-11-23 22:29:18,147 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 127 selfloop transitions, 3 changer transitions 24/206 dead transitions. [2023-11-23 22:29:18,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 206 transitions, 2211 flow [2023-11-23 22:29:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 22:29:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 22:29:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2023-11-23 22:29:18,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2023-11-23 22:29:18,150 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 154 transitions. [2023-11-23 22:29:18,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 154 transitions. [2023-11-23 22:29:18,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:18,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 154 transitions. [2023-11-23 22:29:18,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 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 22:29:18,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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 22:29:18,152 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 39.0) internal successors, (312), 8 states have internal predecessors, (312), 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 22:29:18,152 INFO L175 Difference]: Start difference. First operand has 160 places, 213 transitions, 2080 flow. Second operand 7 states and 154 transitions. [2023-11-23 22:29:18,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 206 transitions, 2211 flow [2023-11-23 22:29:18,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 206 transitions, 2148 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-11-23 22:29:18,292 INFO L231 Difference]: Finished difference. Result has 151 places, 182 transitions, 1721 flow [2023-11-23 22:29:18,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1721, PETRI_PLACES=151, PETRI_TRANSITIONS=182} [2023-11-23 22:29:18,294 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places. [2023-11-23 22:29:18,295 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 182 transitions, 1721 flow [2023-11-23 22:29:18,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 18.533333333333335) internal successors, (278), 15 states have internal predecessors, (278), 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 22:29:18,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:18,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 22:29:18,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 22:29:18,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:18,518 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 1 more)] === [2023-11-23 22:29:18,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash 805047335, now seen corresponding path program 2 times [2023-11-23 22:29:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871194190] [2023-11-23 22:29:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:18,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:29:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871194190] [2023-11-23 22:29:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871194190] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:29:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360362436] [2023-11-23 22:29:19,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 22:29:19,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:29:19,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:19,964 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:29:19,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db03c42b-6282-45f7-adea-260afabecd75/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 22:29:20,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 22:29:20,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:29:20,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 22:29:20,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:29:20,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:29:21,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:29:21,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2023-11-23 22:29:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:29:21,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360362436] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:29:21,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:29:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 37 [2023-11-23 22:29:21,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392021670] [2023-11-23 22:29:21,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:29:21,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-23 22:29:21,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:21,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-23 22:29:21,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1194, Unknown=0, NotChecked=0, Total=1406 [2023-11-23 22:29:22,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2023-11-23 22:29:22,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 182 transitions, 1721 flow. Second operand has 38 states, 38 states have (on average 11.289473684210526) internal successors, (429), 38 states have internal predecessors, (429), 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 22:29:22,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:22,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2023-11-23 22:29:22,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand