./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya --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 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:37:33,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:37:33,294 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:37:33,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:37:33,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:37:33,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:37:33,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:37:33,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:37:33,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:37:33,322 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:37:33,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:37:33,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:37:33,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:37:33,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:37:33,324 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:37:33,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:37:33,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:37:33,326 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:37:33,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:37:33,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:37:33,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:37:33,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:37:33,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:37:33,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:37:33,329 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:37:33,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:37:33,330 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:37:33,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:37:33,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:37:33,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:37:33,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:37:33,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:37:33,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:37:33,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:37:33,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:37:33,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:37:33,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:37:33,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:37:33,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:37:33,333 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:37:33,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:37:33,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:37:33,334 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_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/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_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2023-11-29 00:37:33,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:37:33,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:37:33,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:37:33,593 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:37:33,593 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:37:33,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2023-11-29 00:37:36,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:37:36,577 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:37:36,578 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2023-11-29 00:37:36,594 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/data/8e405888b/31a70765886745cf9282adf61ea9307a/FLAG663c4f317 [2023-11-29 00:37:36,607 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/data/8e405888b/31a70765886745cf9282adf61ea9307a [2023-11-29 00:37:36,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:37:36,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:37:36,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:37:36,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:37:36,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:37:36,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:37:36" (1/1) ... [2023-11-29 00:37:36,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7208a74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:36, skipping insertion in model container [2023-11-29 00:37:36,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:37:36" (1/1) ... [2023-11-29 00:37:36,663 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:37:36,802 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_c86734ef-963a-45ed-94ec-bcd75a466f61/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2023-11-29 00:37:36,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:37:36,990 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:37:36,999 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_c86734ef-963a-45ed-94ec-bcd75a466f61/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2023-11-29 00:37:37,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:37:37,073 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:37:37,073 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:37:37,079 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:37:37,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37 WrapperNode [2023-11-29 00:37:37,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:37:37,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:37:37,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:37:37,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:37:37,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,129 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-11-29 00:37:37,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:37:37,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:37:37,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:37:37,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:37:37,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,163 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 00:37:37,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:37:37,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:37:37,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:37:37,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:37:37,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (1/1) ... [2023-11-29 00:37:37,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:37:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:37:37,222 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:37:37,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:37:37,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:37:37,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:37:37,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:37:37,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:37:37,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:37:37,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:37:37,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:37:37,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:37:37,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 00:37:37,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 00:37:37,305 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 00:37:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 00:37:37,305 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 00:37:37,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 00:37:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:37:37,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:37:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:37:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:37:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:37:37,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:37:37,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:37:37,309 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:37:37,447 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:37:37,449 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:37:37,701 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:37:37,869 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:37:37,870 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:37:37,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:37:37 BoogieIcfgContainer [2023-11-29 00:37:37,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:37:37,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:37:37,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:37:37,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:37:37,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:37:36" (1/3) ... [2023-11-29 00:37:37,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f7d80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:37:37, skipping insertion in model container [2023-11-29 00:37:37,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:37" (2/3) ... [2023-11-29 00:37:37,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f7d80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:37:37, skipping insertion in model container [2023-11-29 00:37:37,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:37:37" (3/3) ... [2023-11-29 00:37:37,881 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2023-11-29 00:37:37,890 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:37:37,900 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:37:37,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 00:37:37,900 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:37:37,950 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:37:37,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2023-11-29 00:37:38,017 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2023-11-29 00:37:38,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:37:38,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2023-11-29 00:37:38,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2023-11-29 00:37:38,025 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2023-11-29 00:37:38,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:37:38,043 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;@6cd5aee2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:37:38,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 00:37:38,050 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:37:38,050 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-11-29 00:37:38,050 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:37:38,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:38,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:37:38,051 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:38,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2059978214, now seen corresponding path program 1 times [2023-11-29 00:37:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:38,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215800682] [2023-11-29 00:37:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:38,464 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-29 00:37:38,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:38,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215800682] [2023-11-29 00:37:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215800682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:38,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:38,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:37:38,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127906769] [2023-11-29 00:37:38,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:38,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:37:38,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:38,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:37:38,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:37:38,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 42 [2023-11-29 00:37:38,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-29 00:37:38,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:38,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 42 [2023-11-29 00:37:38,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:38,757 INFO L124 PetriNetUnfolderBase]: 453/889 cut-off events. [2023-11-29 00:37:38,758 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-11-29 00:37:38,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 889 events. 453/889 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5645 event pairs, 72 based on Foata normal form. 36/896 useless extension candidates. Maximal degree in co-relation 1615. Up to 562 conditions per place. [2023-11-29 00:37:38,769 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 25 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-29 00:37:38,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 166 flow [2023-11-29 00:37:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:37:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:37:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-29 00:37:38,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-11-29 00:37:38,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-29 00:37:38,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-29 00:37:38,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:38,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-29 00:37:38,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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-29 00:37:38,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:38,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:38,790 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 98 transitions. [2023-11-29 00:37:38,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 166 flow [2023-11-29 00:37:38,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 48 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:37:38,795 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2023-11-29 00:37:38,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-11-29 00:37:38,800 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-11-29 00:37:38,800 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2023-11-29 00:37:38,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-29 00:37:38,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:38,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:38,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:37:38,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:38,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -456862293, now seen corresponding path program 1 times [2023-11-29 00:37:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432287469] [2023-11-29 00:37:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:39,081 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-29 00:37:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:39,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432287469] [2023-11-29 00:37:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432287469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:39,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:39,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:37:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288603899] [2023-11-29 00:37:39,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:39,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:37:39,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:39,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:37:39,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:37:39,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2023-11-29 00:37:39,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-29 00:37:39,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:39,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2023-11-29 00:37:39,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:40,212 INFO L124 PetriNetUnfolderBase]: 4504/7163 cut-off events. [2023-11-29 00:37:40,213 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2023-11-29 00:37:40,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14133 conditions, 7163 events. 4504/7163 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 50333 event pairs, 970 based on Foata normal form. 0/6920 useless extension candidates. Maximal degree in co-relation 14123. Up to 3032 conditions per place. [2023-11-29 00:37:40,263 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 38 selfloop transitions, 7 changer transitions 77/133 dead transitions. [2023-11-29 00:37:40,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 133 transitions, 536 flow [2023-11-29 00:37:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:37:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:37:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 250 transitions. [2023-11-29 00:37:40,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6613756613756614 [2023-11-29 00:37:40,266 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 250 transitions. [2023-11-29 00:37:40,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 250 transitions. [2023-11-29 00:37:40,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:40,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 250 transitions. [2023-11-29 00:37:40,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:40,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 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-29 00:37:40,272 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 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-29 00:37:40,272 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 9 states and 250 transitions. [2023-11-29 00:37:40,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 133 transitions, 536 flow [2023-11-29 00:37:40,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 133 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:37:40,276 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 174 flow [2023-11-29 00:37:40,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=174, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-11-29 00:37:40,277 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2023-11-29 00:37:40,277 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 174 flow [2023-11-29 00:37:40,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-29 00:37:40,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:40,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:40,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:37:40,278 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:40,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:40,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1616170800, now seen corresponding path program 1 times [2023-11-29 00:37:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886718562] [2023-11-29 00:37:40,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:40,518 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-29 00:37:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:40,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886718562] [2023-11-29 00:37:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886718562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:40,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:40,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192395040] [2023-11-29 00:37:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:40,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:40,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2023-11-29 00:37:40,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-29 00:37:40,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:40,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2023-11-29 00:37:40,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:41,443 INFO L124 PetriNetUnfolderBase]: 3183/5218 cut-off events. [2023-11-29 00:37:41,443 INFO L125 PetriNetUnfolderBase]: For 7222/7240 co-relation queries the response was YES. [2023-11-29 00:37:41,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15991 conditions, 5218 events. 3183/5218 cut-off events. For 7222/7240 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 35856 event pairs, 594 based on Foata normal form. 184/5375 useless extension candidates. Maximal degree in co-relation 15973. Up to 2037 conditions per place. [2023-11-29 00:37:41,475 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 45 selfloop transitions, 7 changer transitions 66/129 dead transitions. [2023-11-29 00:37:41,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 129 transitions, 820 flow [2023-11-29 00:37:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:37:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 00:37:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2023-11-29 00:37:41,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2023-11-29 00:37:41,478 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 248 transitions. [2023-11-29 00:37:41,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 248 transitions. [2023-11-29 00:37:41,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:41,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 248 transitions. [2023-11-29 00:37:41,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 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-29 00:37:41,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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-29 00:37:41,483 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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-29 00:37:41,483 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 174 flow. Second operand 10 states and 248 transitions. [2023-11-29 00:37:41,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 129 transitions, 820 flow [2023-11-29 00:37:41,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 129 transitions, 706 flow, removed 29 selfloop flow, removed 4 redundant places. [2023-11-29 00:37:41,513 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 216 flow [2023-11-29 00:37:41,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2023-11-29 00:37:41,514 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-11-29 00:37:41,514 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 216 flow [2023-11-29 00:37:41,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-29 00:37:41,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:41,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:41,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:37:41,515 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:41,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash -800734677, now seen corresponding path program 1 times [2023-11-29 00:37:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049969324] [2023-11-29 00:37:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:41,653 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-29 00:37:41,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:41,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049969324] [2023-11-29 00:37:41,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049969324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:41,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:37:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212999581] [2023-11-29 00:37:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:41,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:37:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:37:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:37:41,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-29 00:37:41,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-29 00:37:41,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:41,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-29 00:37:41,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:42,463 INFO L124 PetriNetUnfolderBase]: 1939/3527 cut-off events. [2023-11-29 00:37:42,464 INFO L125 PetriNetUnfolderBase]: For 6637/6801 co-relation queries the response was YES. [2023-11-29 00:37:42,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10650 conditions, 3527 events. 1939/3527 cut-off events. For 6637/6801 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 25264 event pairs, 764 based on Foata normal form. 167/3567 useless extension candidates. Maximal degree in co-relation 10625. Up to 1979 conditions per place. [2023-11-29 00:37:42,501 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 32 selfloop transitions, 4 changer transitions 33/89 dead transitions. [2023-11-29 00:37:42,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 516 flow [2023-11-29 00:37:42,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:37:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:37:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2023-11-29 00:37:42,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2023-11-29 00:37:42,503 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 189 transitions. [2023-11-29 00:37:42,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 189 transitions. [2023-11-29 00:37:42,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:42,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 189 transitions. [2023-11-29 00:37:42,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 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-29 00:37:42,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 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-29 00:37:42,506 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 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-29 00:37:42,506 INFO L175 Difference]: Start difference. First operand has 66 places, 44 transitions, 216 flow. Second operand 7 states and 189 transitions. [2023-11-29 00:37:42,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 516 flow [2023-11-29 00:37:42,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 89 transitions, 483 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-29 00:37:42,540 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 217 flow [2023-11-29 00:37:42,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2023-11-29 00:37:42,541 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-11-29 00:37:42,542 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 217 flow [2023-11-29 00:37:42,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-29 00:37:42,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:42,542 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] [2023-11-29 00:37:42,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:37:42,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:42,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1842523055, now seen corresponding path program 1 times [2023-11-29 00:37:42,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:42,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333515682] [2023-11-29 00:37:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:42,672 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-29 00:37:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:42,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333515682] [2023-11-29 00:37:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333515682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:42,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:37:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095547135] [2023-11-29 00:37:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:42,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:37:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:37:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:37:42,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-29 00:37:42,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-29 00:37:42,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:42,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-29 00:37:42,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:43,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][33], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, 33#L804true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 108#(= ~__unbuffered_p0_EAX~0 0), 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,048 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-29 00:37:43,049 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 00:37:43,049 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 00:37:43,049 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 00:37:43,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#L850true, Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,073 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-29 00:37:43,073 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 00:37:43,073 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 00:37:43,073 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 00:37:43,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,106 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,106 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,106 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,106 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#L850true, Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,134 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,134 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,134 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,134 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,136 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,136 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,136 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,137 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:43,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 33#L804true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 21#L778true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,158 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,158 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,158 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,158 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,170 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,170 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,170 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,170 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#L850true, Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,198 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,198 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,198 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,198 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,201 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,201 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,201 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,202 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 31#L854true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 123#true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,204 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,204 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,205 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,205 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:43,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 33#L804true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 35#P0EXITtrue, Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,261 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,261 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,261 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,261 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, 41#L827true, 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 21#L778true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,262 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,262 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,262 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,262 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#L850true, Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,297 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,297 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,297 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,297 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#L850true, Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,298 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,298 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,298 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,298 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,299 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,299 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,299 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,299 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, 31#L854true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 123#true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,303 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,303 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,303 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,303 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L860-->L863: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_2 1) (= v_~__unbuffered_p0_EBX~0_2 0) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 2) (= 2 v_~z~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~z~0=v_~z~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~z~0=v_~z~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][61], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 29#L863true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 6#L820true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 108#(= ~__unbuffered_p0_EAX~0 0), 123#true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,306 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,306 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,306 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,306 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 10#L860true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,306 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,307 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,307 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,307 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:43,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, 41#L827true, 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,324 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,324 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,324 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,324 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, 21#L778true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,325 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,325 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,325 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,325 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 24#L850true, Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 28#P1EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,360 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,361 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,361 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,361 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,361 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,362 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,362 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,362 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,362 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 31#L854true, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,363 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,363 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,363 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,364 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L860-->L863: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_2 1) (= v_~__unbuffered_p0_EBX~0_2 0) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 2) (= 2 v_~z~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~z~0=v_~z~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~z~0=v_~z~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][61], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 29#L863true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 6#L820true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 123#true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,366 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,366 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,366 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,366 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 37#L773true, Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 10#L860true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,367 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,367 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,367 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,367 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:43,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][52], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 35#P0EXITtrue, 28#P1EXITtrue, Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:43,380 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,381 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,381 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,381 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 16#L852true, 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,415 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,415 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,415 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,415 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 123#true, 31#L854true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,416 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,416 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,416 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,416 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, 123#true, 31#L854true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,417 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,417 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,417 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,417 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L860-->L863: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_2 1) (= v_~__unbuffered_p0_EBX~0_2 0) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 2) (= 2 v_~z~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~z~0=v_~z~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~z~0=v_~z~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][61], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 29#L863true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 6#L820true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 108#(= ~__unbuffered_p0_EAX~0 0), 123#true, 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,418 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,418 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,418 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,418 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 10#L860true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,419 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,419 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,419 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,419 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:43,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 28#P1EXITtrue, 31#L854true, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,459 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,460 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,460 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,460 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L860-->L863: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_2 1) (= v_~__unbuffered_p0_EBX~0_2 0) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 2) (= 2 v_~z~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~z~0=v_~z~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~z~0=v_~z~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][61], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 29#L863true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 6#L820true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,461 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,461 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,461 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,461 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 10#L860true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 45#L807true]) [2023-11-29 00:37:43,461 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,461 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,462 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,462 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L860-->L863: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_2 1) (= v_~__unbuffered_p0_EBX~0_2 0) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 2) (= 2 v_~z~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~z~0=v_~z~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~z~0=v_~z~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][61], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 29#L863true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 6#L820true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,462 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,462 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,463 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,463 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 10#L860true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,463 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,463 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,463 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,463 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:37:43,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L860-->L863: Formula: (= v_~main$tmp_guard1~0_1 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_2 1) (= v_~__unbuffered_p0_EBX~0_2 0) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 2) (= 2 v_~z~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~z~0=v_~z~0_4} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_2, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_1, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~z~0=v_~z~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][61], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 29#L863true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 6#L820true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,486 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 00:37:43,486 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:37:43,486 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:37:43,486 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:37:43,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][51], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 91#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 93#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), Black: 95#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 10#L860true, P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 106#true, P1Thread1of1ForFork2InUse, Black: 116#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 112#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 114#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p0_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 35#P0EXITtrue, 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), Black: 109#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0))]) [2023-11-29 00:37:43,487 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 00:37:43,487 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:37:43,487 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:37:43,487 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:37:43,519 INFO L124 PetriNetUnfolderBase]: 3102/5212 cut-off events. [2023-11-29 00:37:43,520 INFO L125 PetriNetUnfolderBase]: For 4570/4830 co-relation queries the response was YES. [2023-11-29 00:37:43,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13018 conditions, 5212 events. 3102/5212 cut-off events. For 4570/4830 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 34774 event pairs, 692 based on Foata normal form. 301/5257 useless extension candidates. Maximal degree in co-relation 12991. Up to 2470 conditions per place. [2023-11-29 00:37:43,556 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 45 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2023-11-29 00:37:43,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 71 transitions, 415 flow [2023-11-29 00:37:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:37:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:37:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2023-11-29 00:37:43,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2023-11-29 00:37:43,558 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 118 transitions. [2023-11-29 00:37:43,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 118 transitions. [2023-11-29 00:37:43,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:43,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 118 transitions. [2023-11-29 00:37:43,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:43,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:43,560 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:43,560 INFO L175 Difference]: Start difference. First operand has 66 places, 44 transitions, 217 flow. Second operand 4 states and 118 transitions. [2023-11-29 00:37:43,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 71 transitions, 415 flow [2023-11-29 00:37:43,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 381 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-11-29 00:37:43,587 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 229 flow [2023-11-29 00:37:43,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-29 00:37:43,588 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-11-29 00:37:43,588 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 229 flow [2023-11-29 00:37:43,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-29 00:37:43,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:43,589 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-29 00:37:43,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:37:43,589 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:43,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1704686100, now seen corresponding path program 1 times [2023-11-29 00:37:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:43,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185475260] [2023-11-29 00:37:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:43,767 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-29 00:37:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:43,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185475260] [2023-11-29 00:37:43,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185475260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:43,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:43,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:37:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347848182] [2023-11-29 00:37:43,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:43,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:37:43,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:43,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:37:43,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:37:43,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-29 00:37:43,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-29 00:37:43,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:43,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-29 00:37:43,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:44,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][47], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 37#L773true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, 41#L827true, 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 140#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:44,127 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-29 00:37:44,128 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:44,128 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:44,128 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:44,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][47], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 37#L773true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 140#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 123#true, 45#L807true]) [2023-11-29 00:37:44,132 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-29 00:37:44,132 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:44,132 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:44,133 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:37:44,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][47], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 37#L773true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 140#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 28#P1EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:44,171 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:37:44,171 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:44,171 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:44,172 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:44,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][47], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 37#L773true, Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 140#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0)]) [2023-11-29 00:37:44,174 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:37:44,174 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:44,174 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:44,174 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:37:44,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][60], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, 41#L827true, 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, 136#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true, 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:44,208 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:44,208 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:44,209 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:44,209 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:44,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][60], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, 41#L827true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, 136#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 123#true, 21#L778true, 45#L807true]) [2023-11-29 00:37:44,210 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-29 00:37:44,210 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:44,211 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:44,211 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-29 00:37:44,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][60], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, 136#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 28#P1EXITtrue, 21#L778true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:44,244 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,244 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,244 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,245 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][60], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, 41#L827true, 80#true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, 136#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 35#P0EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 45#L807true, 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:44,245 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,245 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,246 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,246 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][60], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 41#L827true, 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, 136#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 28#P1EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 21#L778true]) [2023-11-29 00:37:44,247 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,247 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,247 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,247 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][60], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 136#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 35#P0EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 123#true, 45#L807true]) [2023-11-29 00:37:44,249 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,249 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,249 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,249 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 00:37:44,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][60], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 136#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 35#P0EXITtrue, 28#P1EXITtrue, Black: 108#(= ~__unbuffered_p0_EAX~0 0), 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256)))]) [2023-11-29 00:37:44,276 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:37:44,276 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:44,276 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:44,276 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:44,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_95 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_94 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_95)) (= v_~y$r_buff0_thd3~0_29 (ite .cse0 0 v_~y$r_buff0_thd3~0_30)) (= (ite .cse2 0 v_~y$w_buff0_used~0_106) v_~y$w_buff0_used~0_105) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_47 v_~y~0_59)) v_~y~0_58) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_94 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)))) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_47, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_94} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][60], [Black: 83#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 128#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 126#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 82#(= ~__unbuffered_p2_EAX~0 0), 16#L852true, 41#L827true, Black: 60#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 80#true, Black: 64#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 66#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, 136#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 28#P1EXITtrue, 35#P0EXITtrue, 123#true, Black: 108#(= ~__unbuffered_p0_EAX~0 0)]) [2023-11-29 00:37:44,277 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:37:44,277 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:44,277 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:44,277 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:37:44,349 INFO L124 PetriNetUnfolderBase]: 2312/3920 cut-off events. [2023-11-29 00:37:44,349 INFO L125 PetriNetUnfolderBase]: For 3122/3316 co-relation queries the response was YES. [2023-11-29 00:37:44,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10780 conditions, 3920 events. 2312/3920 cut-off events. For 3122/3316 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 24791 event pairs, 447 based on Foata normal form. 242/3928 useless extension candidates. Maximal degree in co-relation 10759. Up to 1159 conditions per place. [2023-11-29 00:37:44,369 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 56 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2023-11-29 00:37:44,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 492 flow [2023-11-29 00:37:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:37:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:37:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2023-11-29 00:37:44,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-29 00:37:44,371 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 150 transitions. [2023-11-29 00:37:44,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 150 transitions. [2023-11-29 00:37:44,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:44,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 150 transitions. [2023-11-29 00:37:44,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-29 00:37:44,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 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-29 00:37:44,373 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 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-29 00:37:44,374 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 229 flow. Second operand 5 states and 150 transitions. [2023-11-29 00:37:44,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 492 flow [2023-11-29 00:37:44,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 85 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:37:44,378 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 281 flow [2023-11-29 00:37:44,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-29 00:37:44,379 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2023-11-29 00:37:44,380 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 281 flow [2023-11-29 00:37:44,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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-29 00:37:44,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:44,380 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-29 00:37:44,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:37:44,381 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:44,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1074984873, now seen corresponding path program 1 times [2023-11-29 00:37:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502909799] [2023-11-29 00:37:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:44,627 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-29 00:37:44,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502909799] [2023-11-29 00:37:44,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502909799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:44,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:44,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:37:44,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138208740] [2023-11-29 00:37:44,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:44,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:44,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:44,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:44,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:44,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2023-11-29 00:37:44,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-29 00:37:44,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:44,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2023-11-29 00:37:44,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:45,418 INFO L124 PetriNetUnfolderBase]: 2853/5163 cut-off events. [2023-11-29 00:37:45,418 INFO L125 PetriNetUnfolderBase]: For 6435/7075 co-relation queries the response was YES. [2023-11-29 00:37:45,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15336 conditions, 5163 events. 2853/5163 cut-off events. For 6435/7075 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 36189 event pairs, 640 based on Foata normal form. 159/5006 useless extension candidates. Maximal degree in co-relation 15312. Up to 1960 conditions per place. [2023-11-29 00:37:45,442 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 62 selfloop transitions, 19 changer transitions 25/124 dead transitions. [2023-11-29 00:37:45,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 766 flow [2023-11-29 00:37:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:37:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:37:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 218 transitions. [2023-11-29 00:37:45,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5767195767195767 [2023-11-29 00:37:45,444 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 218 transitions. [2023-11-29 00:37:45,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 218 transitions. [2023-11-29 00:37:45,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:45,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 218 transitions. [2023-11-29 00:37:45,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 states have internal predecessors, (218), 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-29 00:37:45,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 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-29 00:37:45,447 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 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-29 00:37:45,447 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 281 flow. Second operand 9 states and 218 transitions. [2023-11-29 00:37:45,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 766 flow [2023-11-29 00:37:45,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 754 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 00:37:45,457 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 430 flow [2023-11-29 00:37:45,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=430, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2023-11-29 00:37:45,458 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2023-11-29 00:37:45,459 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 430 flow [2023-11-29 00:37:45,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-29 00:37:45,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:45,459 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-29 00:37:45,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:37:45,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:45,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1767293373, now seen corresponding path program 2 times [2023-11-29 00:37:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:45,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041605551] [2023-11-29 00:37:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:45,697 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-29 00:37:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:45,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041605551] [2023-11-29 00:37:45,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041605551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:45,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:45,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:37:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315316278] [2023-11-29 00:37:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:45,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:37:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:37:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:37:45,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2023-11-29 00:37:45,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 430 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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-29 00:37:45,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:45,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2023-11-29 00:37:45,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:46,636 INFO L124 PetriNetUnfolderBase]: 3681/6667 cut-off events. [2023-11-29 00:37:46,636 INFO L125 PetriNetUnfolderBase]: For 14264/15018 co-relation queries the response was YES. [2023-11-29 00:37:46,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21770 conditions, 6667 events. 3681/6667 cut-off events. For 14264/15018 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 50140 event pairs, 944 based on Foata normal form. 189/6353 useless extension candidates. Maximal degree in co-relation 21739. Up to 2100 conditions per place. [2023-11-29 00:37:46,666 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 68 selfloop transitions, 18 changer transitions 28/132 dead transitions. [2023-11-29 00:37:46,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 132 transitions, 974 flow [2023-11-29 00:37:46,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:37:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:37:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2023-11-29 00:37:46,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6279761904761905 [2023-11-29 00:37:46,668 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 211 transitions. [2023-11-29 00:37:46,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 211 transitions. [2023-11-29 00:37:46,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:46,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 211 transitions. [2023-11-29 00:37:46,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 26.375) internal successors, (211), 8 states have internal predecessors, (211), 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-29 00:37:46,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 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-29 00:37:46,671 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 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-29 00:37:46,672 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 430 flow. Second operand 8 states and 211 transitions. [2023-11-29 00:37:46,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 132 transitions, 974 flow [2023-11-29 00:37:46,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 132 transitions, 930 flow, removed 22 selfloop flow, removed 4 redundant places. [2023-11-29 00:37:46,732 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 427 flow [2023-11-29 00:37:46,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=427, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2023-11-29 00:37:46,733 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 29 predicate places. [2023-11-29 00:37:46,733 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 427 flow [2023-11-29 00:37:46,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 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-29 00:37:46,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:46,734 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-29 00:37:46,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:37:46,734 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:46,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash 471089073, now seen corresponding path program 3 times [2023-11-29 00:37:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:46,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196165199] [2023-11-29 00:37:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:46,921 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-29 00:37:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:46,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196165199] [2023-11-29 00:37:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196165199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:46,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101769023] [2023-11-29 00:37:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:46,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:46,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:46,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2023-11-29 00:37:46,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-29 00:37:46,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:46,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2023-11-29 00:37:46,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:47,492 INFO L124 PetriNetUnfolderBase]: 2504/4237 cut-off events. [2023-11-29 00:37:47,493 INFO L125 PetriNetUnfolderBase]: For 8387/9181 co-relation queries the response was YES. [2023-11-29 00:37:47,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13385 conditions, 4237 events. 2504/4237 cut-off events. For 8387/9181 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 28117 event pairs, 432 based on Foata normal form. 253/4241 useless extension candidates. Maximal degree in co-relation 13353. Up to 1518 conditions per place. [2023-11-29 00:37:47,506 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 42 selfloop transitions, 11 changer transitions 11/89 dead transitions. [2023-11-29 00:37:47,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 669 flow [2023-11-29 00:37:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2023-11-29 00:37:47,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2023-11-29 00:37:47,508 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 166 transitions. [2023-11-29 00:37:47,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 166 transitions. [2023-11-29 00:37:47,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:47,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 166 transitions. [2023-11-29 00:37:47,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 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-29 00:37:47,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 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-29 00:37:47,510 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 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-29 00:37:47,510 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 427 flow. Second operand 6 states and 166 transitions. [2023-11-29 00:37:47,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 669 flow [2023-11-29 00:37:47,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 596 flow, removed 8 selfloop flow, removed 10 redundant places. [2023-11-29 00:37:47,519 INFO L231 Difference]: Finished difference. Result has 72 places, 55 transitions, 356 flow [2023-11-29 00:37:47,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=356, PETRI_PLACES=72, PETRI_TRANSITIONS=55} [2023-11-29 00:37:47,520 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2023-11-29 00:37:47,520 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 356 flow [2023-11-29 00:37:47,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-29 00:37:47,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:47,520 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-29 00:37:47,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:37:47,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:47,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 25867927, now seen corresponding path program 1 times [2023-11-29 00:37:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:47,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583317356] [2023-11-29 00:37:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:47,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:47,726 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-29 00:37:47,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583317356] [2023-11-29 00:37:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583317356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:47,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:47,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:37:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774035426] [2023-11-29 00:37:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:47,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:47,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 42 [2023-11-29 00:37:47,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-29 00:37:47,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:47,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 42 [2023-11-29 00:37:47,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:48,306 INFO L124 PetriNetUnfolderBase]: 2085/4165 cut-off events. [2023-11-29 00:37:48,306 INFO L125 PetriNetUnfolderBase]: For 10029/10508 co-relation queries the response was YES. [2023-11-29 00:37:48,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13364 conditions, 4165 events. 2085/4165 cut-off events. For 10029/10508 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 32727 event pairs, 712 based on Foata normal form. 72/3828 useless extension candidates. Maximal degree in co-relation 13336. Up to 1534 conditions per place. [2023-11-29 00:37:48,328 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 27 selfloop transitions, 3 changer transitions 38/88 dead transitions. [2023-11-29 00:37:48,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 88 transitions, 646 flow [2023-11-29 00:37:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2023-11-29 00:37:48,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2023-11-29 00:37:48,330 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 141 transitions. [2023-11-29 00:37:48,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 141 transitions. [2023-11-29 00:37:48,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:48,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 141 transitions. [2023-11-29 00:37:48,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-29 00:37:48,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 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-29 00:37:48,333 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 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-29 00:37:48,333 INFO L175 Difference]: Start difference. First operand has 72 places, 55 transitions, 356 flow. Second operand 6 states and 141 transitions. [2023-11-29 00:37:48,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 88 transitions, 646 flow [2023-11-29 00:37:48,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 552 flow, removed 34 selfloop flow, removed 8 redundant places. [2023-11-29 00:37:48,400 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 202 flow [2023-11-29 00:37:48,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2023-11-29 00:37:48,401 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2023-11-29 00:37:48,402 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 202 flow [2023-11-29 00:37:48,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-29 00:37:48,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:48,402 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-29 00:37:48,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:37:48,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:48,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1693147761, now seen corresponding path program 2 times [2023-11-29 00:37:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:48,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61003631] [2023-11-29 00:37:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:48,862 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-29 00:37:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:48,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61003631] [2023-11-29 00:37:48,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61003631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:48,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:48,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:37:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787622863] [2023-11-29 00:37:48,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:48,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:37:48,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:48,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:37:48,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:37:48,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2023-11-29 00:37:48,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 202 flow. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:48,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:48,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2023-11-29 00:37:48,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:49,130 INFO L124 PetriNetUnfolderBase]: 492/1066 cut-off events. [2023-11-29 00:37:49,130 INFO L125 PetriNetUnfolderBase]: For 568/648 co-relation queries the response was YES. [2023-11-29 00:37:49,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2648 conditions, 1066 events. 492/1066 cut-off events. For 568/648 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6637 event pairs, 131 based on Foata normal form. 12/964 useless extension candidates. Maximal degree in co-relation 2632. Up to 322 conditions per place. [2023-11-29 00:37:49,136 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 26 selfloop transitions, 5 changer transitions 19/75 dead transitions. [2023-11-29 00:37:49,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 392 flow [2023-11-29 00:37:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:37:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:37:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions. [2023-11-29 00:37:49,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2023-11-29 00:37:49,138 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 222 transitions. [2023-11-29 00:37:49,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 222 transitions. [2023-11-29 00:37:49,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:49,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 222 transitions. [2023-11-29 00:37:49,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.666666666666668) internal successors, (222), 9 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:49,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 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-29 00:37:49,140 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 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-29 00:37:49,140 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 202 flow. Second operand 9 states and 222 transitions. [2023-11-29 00:37:49,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 392 flow [2023-11-29 00:37:49,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 351 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-11-29 00:37:49,144 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 202 flow [2023-11-29 00:37:49,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2023-11-29 00:37:49,145 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2023-11-29 00:37:49,145 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 202 flow [2023-11-29 00:37:49,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:49,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:49,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:49,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:37:49,146 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-29 00:37:49,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash 586185717, now seen corresponding path program 3 times [2023-11-29 00:37:49,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:49,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176013274] [2023-11-29 00:37:49,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:49,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:37:49,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:37:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:37:49,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:37:49,267 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:37:49,268 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-29 00:37:49,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-29 00:37:49,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-29 00:37:49,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-29 00:37:49,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-29 00:37:49,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-29 00:37:49,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:37:49,271 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:49,277 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:37:49,277 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:37:49,327 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 00:37:49,329 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 00:37:49,329 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 00:37:49,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:37:49 BasicIcfg [2023-11-29 00:37:49,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:37:49,355 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:37:49,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:37:49,356 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:37:49,356 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:37:37" (3/4) ... [2023-11-29 00:37:49,357 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 00:37:49,383 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 00:37:49,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 00:37:49,384 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 00:37:49,448 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:37:49,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:37:49,449 INFO L158 Benchmark]: Toolchain (without parser) took 12837.93ms. Allocated memory was 176.2MB in the beginning and 897.6MB in the end (delta: 721.4MB). Free memory was 139.7MB in the beginning and 337.1MB in the end (delta: -197.4MB). Peak memory consumption was 522.7MB. Max. memory is 16.1GB. [2023-11-29 00:37:49,449 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:37:49,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.45ms. Allocated memory is still 176.2MB. Free memory was 139.7MB in the beginning and 115.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 00:37:49,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.73ms. Allocated memory is still 176.2MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:37:49,451 INFO L158 Benchmark]: Boogie Preprocessor took 52.75ms. Allocated memory is still 176.2MB. Free memory was 113.7MB in the beginning and 110.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:37:49,451 INFO L158 Benchmark]: RCFGBuilder took 687.25ms. Allocated memory is still 176.2MB. Free memory was 110.3MB in the beginning and 102.4MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:37:49,451 INFO L158 Benchmark]: TraceAbstraction took 11481.61ms. Allocated memory was 176.2MB in the beginning and 897.6MB in the end (delta: 721.4MB). Free memory was 101.6MB in the beginning and 351.8MB in the end (delta: -250.1MB). Peak memory consumption was 471.9MB. Max. memory is 16.1GB. [2023-11-29 00:37:49,452 INFO L158 Benchmark]: Witness Printer took 93.12ms. Allocated memory is still 897.6MB. Free memory was 350.7MB in the beginning and 337.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:37:49,454 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.45ms. Allocated memory is still 176.2MB. Free memory was 139.7MB in the beginning and 115.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.73ms. Allocated memory is still 176.2MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.75ms. Allocated memory is still 176.2MB. Free memory was 113.7MB in the beginning and 110.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 687.25ms. Allocated memory is still 176.2MB. Free memory was 110.3MB in the beginning and 102.4MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11481.61ms. Allocated memory was 176.2MB in the beginning and 897.6MB in the end (delta: 721.4MB). Free memory was 101.6MB in the beginning and 351.8MB in the end (delta: -250.1MB). Peak memory consumption was 471.9MB. Max. memory is 16.1GB. * Witness Printer took 93.12ms. Allocated memory is still 897.6MB. Free memory was 350.7MB in the beginning and 337.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 594 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 567 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1515 IncrementalHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 67 mSDtfsCounter, 1515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 1527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 00:37:49,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c86734ef-963a-45ed-94ec-bcd75a466f61/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE