./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/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_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:40:16,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:40:16,585 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:40:16,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:40:16,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:40:16,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:40:16,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:40:16,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:40:16,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:40:16,618 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:40:16,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:40:16,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:40:16,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:40:16,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:40:16,621 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:40:16,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:40:16,622 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:40:16,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:40:16,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:40:16,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:40:16,624 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:40:16,626 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:40:16,627 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:40:16,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:40:16,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:40:16,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:40:16,629 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:40:16,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:40:16,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:40:16,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:40:16,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:40:16,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:40:16,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:40:16,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:40:16,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:40:16,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:40:16,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:40:16,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:40:16,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:40:16,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:40:16,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:40:16,633 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_aa8d2732-20c1-4d46-ac4f-4c5467edd752/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_aa8d2732-20c1-4d46-ac4f-4c5467edd752/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c [2023-11-29 04:40:16,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:40:16,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:40:16,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:40:16,896 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:40:16,896 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:40:16,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2023-11-29 04:40:19,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:40:19,862 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:40:19,863 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2023-11-29 04:40:19,870 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/data/b7ad2b729/0f7d0b877446443081b4fad528eacec7/FLAG4f38d9bad [2023-11-29 04:40:19,882 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/data/b7ad2b729/0f7d0b877446443081b4fad528eacec7 [2023-11-29 04:40:19,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:40:19,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:40:19,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:40:19,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:40:19,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:40:19,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:40:19" (1/1) ... [2023-11-29 04:40:19,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3fa01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:19, skipping insertion in model container [2023-11-29 04:40:19,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:40:19" (1/1) ... [2023-11-29 04:40:19,916 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:40:20,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:40:20,073 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:40:20,097 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:40:20,106 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:40:20,106 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:40:20,112 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:40:20,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20 WrapperNode [2023-11-29 04:40:20,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:40:20,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:40:20,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:40:20,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:40:20,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,149 INFO L138 Inliner]: procedures = 22, calls = 38, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2023-11-29 04:40:20,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:40:20,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:40:20,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:40:20,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:40:20,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,178 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 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 04:40:20,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:40:20,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:40:20,199 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:40:20,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:40:20,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (1/1) ... [2023-11-29 04:40:20,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:40:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:40:20,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:40:20,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:40:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:40:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 04:40:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 04:40:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 04:40:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 04:40:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 04:40:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 04:40:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:40:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:40:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:40:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 04:40:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:40:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:40:20,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:40:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:40:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 04:40:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:40:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:40:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:40:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:40:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:40:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:40:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:40:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 04:40:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:40:20,273 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 04:40:20,386 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:40:20,388 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:40:20,639 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:40:20,794 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:40:20,794 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 04:40:20,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:40:20 BoogieIcfgContainer [2023-11-29 04:40:20,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:40:20,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:40:20,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:40:20,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:40:20,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:40:19" (1/3) ... [2023-11-29 04:40:20,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15866644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:40:20, skipping insertion in model container [2023-11-29 04:40:20,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:20" (2/3) ... [2023-11-29 04:40:20,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15866644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:40:20, skipping insertion in model container [2023-11-29 04:40:20,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:40:20" (3/3) ... [2023-11-29 04:40:20,805 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2023-11-29 04:40:20,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:40:20,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-29 04:40:20,837 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:40:20,892 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 04:40:20,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 145 flow [2023-11-29 04:40:20,958 INFO L124 PetriNetUnfolderBase]: 6/59 cut-off events. [2023-11-29 04:40:20,959 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 04:40:20,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 59 events. 6/59 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-11-29 04:40:20,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 62 transitions, 145 flow [2023-11-29 04:40:20,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 58 transitions, 134 flow [2023-11-29 04:40:20,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:40:20,983 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@12eca28c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:40:20,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-29 04:40:20,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:40:20,987 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 04:40:20,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:40:20,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:20,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:40:20,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:20,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash 11731, now seen corresponding path program 1 times [2023-11-29 04:40:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:21,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215623155] [2023-11-29 04:40:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:21,286 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 04:40:21,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:21,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215623155] [2023-11-29 04:40:21,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215623155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:21,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:21,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:40:21,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446273008] [2023-11-29 04:40:21,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:21,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:21,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:21,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-29 04:40:21,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 04:40:21,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:21,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-29 04:40:21,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:21,582 INFO L124 PetriNetUnfolderBase]: 525/933 cut-off events. [2023-11-29 04:40:21,582 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-29 04:40:21,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 933 events. 525/933 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4636 event pairs, 211 based on Foata normal form. 1/769 useless extension candidates. Maximal degree in co-relation 1463. Up to 638 conditions per place. [2023-11-29 04:40:21,603 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 20 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-11-29 04:40:21,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 168 flow [2023-11-29 04:40:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2023-11-29 04:40:21,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2023-11-29 04:40:21,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2023-11-29 04:40:21,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2023-11-29 04:40:21,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:21,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2023-11-29 04:40:21,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 04:40:21,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:21,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:21,632 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 134 flow. Second operand 3 states and 135 transitions. [2023-11-29 04:40:21,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 168 flow [2023-11-29 04:40:21,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 156 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 04:40:21,639 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 116 flow [2023-11-29 04:40:21,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2023-11-29 04:40:21,645 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2023-11-29 04:40:21,645 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 116 flow [2023-11-29 04:40:21,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 04:40:21,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:21,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 04:40:21,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:40:21,647 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:21,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash 11732, now seen corresponding path program 1 times [2023-11-29 04:40:21,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048288776] [2023-11-29 04:40:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:21,797 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 04:40:21,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:21,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048288776] [2023-11-29 04:40:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048288776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:21,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:40:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231897072] [2023-11-29 04:40:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:21,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:21,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:21,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:21,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-29 04:40:21,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:21,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:21,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-29 04:40:21,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:21,955 INFO L124 PetriNetUnfolderBase]: 366/737 cut-off events. [2023-11-29 04:40:21,955 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 04:40:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 737 events. 366/737 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3760 event pairs, 136 based on Foata normal form. 37/633 useless extension candidates. Maximal degree in co-relation 1194. Up to 442 conditions per place. [2023-11-29 04:40:21,963 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 18 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-11-29 04:40:21,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 150 flow [2023-11-29 04:40:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 04:40:21,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2023-11-29 04:40:21,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 04:40:21,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 04:40:21,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:21,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 04:40:21,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 04:40:21,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:21,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:21,969 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 116 flow. Second operand 3 states and 138 transitions. [2023-11-29 04:40:21,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 150 flow [2023-11-29 04:40:21,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:21,972 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 113 flow [2023-11-29 04:40:21,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2023-11-29 04:40:21,973 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-29 04:40:21,973 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 113 flow [2023-11-29 04:40:21,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:21,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:21,973 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:40:21,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:40:21,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:21,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:21,974 INFO L85 PathProgramCache]: Analyzing trace with hash 349842003, now seen corresponding path program 1 times [2023-11-29 04:40:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:21,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51591281] [2023-11-29 04:40:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:21,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:22,035 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 04:40:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51591281] [2023-11-29 04:40:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51591281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:22,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:22,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:40:22,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779297286] [2023-11-29 04:40:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:22,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:22,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:22,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:22,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:22,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-29 04:40:22,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 04:40:22,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:22,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-29 04:40:22,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:22,185 INFO L124 PetriNetUnfolderBase]: 397/760 cut-off events. [2023-11-29 04:40:22,185 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-29 04:40:22,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 760 events. 397/760 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3797 event pairs, 151 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1261. Up to 486 conditions per place. [2023-11-29 04:40:22,195 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 20 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-11-29 04:40:22,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 151 flow [2023-11-29 04:40:22,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-29 04:40:22,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2023-11-29 04:40:22,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-29 04:40:22,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-29 04:40:22,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:22,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-29 04:40:22,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:22,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:22,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:22,200 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 113 flow. Second operand 3 states and 134 transitions. [2023-11-29 04:40:22,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 151 flow [2023-11-29 04:40:22,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:22,203 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 110 flow [2023-11-29 04:40:22,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-11-29 04:40:22,204 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2023-11-29 04:40:22,204 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 110 flow [2023-11-29 04:40:22,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 04:40:22,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:22,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:40:22,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:40:22,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:22,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash 349842004, now seen corresponding path program 1 times [2023-11-29 04:40:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824252227] [2023-11-29 04:40:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:22,307 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 04:40:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824252227] [2023-11-29 04:40:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824252227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:40:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434114376] [2023-11-29 04:40:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:22,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:22,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-29 04:40:22,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 04:40:22,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:22,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-29 04:40:22,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:22,438 INFO L124 PetriNetUnfolderBase]: 366/713 cut-off events. [2023-11-29 04:40:22,439 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 04:40:22,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 713 events. 366/713 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3546 event pairs, 136 based on Foata normal form. 13/609 useless extension candidates. Maximal degree in co-relation 1170. Up to 442 conditions per place. [2023-11-29 04:40:22,446 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 18 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-11-29 04:40:22,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 144 flow [2023-11-29 04:40:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 04:40:22,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2023-11-29 04:40:22,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 04:40:22,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 04:40:22,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:22,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 04:40:22,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 04:40:22,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:22,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:22,451 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 110 flow. Second operand 3 states and 138 transitions. [2023-11-29 04:40:22,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 144 flow [2023-11-29 04:40:22,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:22,453 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 107 flow [2023-11-29 04:40:22,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-11-29 04:40:22,454 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2023-11-29 04:40:22,454 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 107 flow [2023-11-29 04:40:22,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 04:40:22,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:22,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:22,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:40:22,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:22,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1742153433, now seen corresponding path program 1 times [2023-11-29 04:40:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:22,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813750858] [2023-11-29 04:40:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:22,497 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 04:40:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813750858] [2023-11-29 04:40:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813750858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:22,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:40:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503310777] [2023-11-29 04:40:22,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:22,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:22,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:22,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:22,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-29 04:40:22,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:22,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:22,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-29 04:40:22,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:22,632 INFO L124 PetriNetUnfolderBase]: 397/735 cut-off events. [2023-11-29 04:40:22,632 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-29 04:40:22,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 735 events. 397/735 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3548 event pairs, 152 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1234. Up to 484 conditions per place. [2023-11-29 04:40:22,639 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 20 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-11-29 04:40:22,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 145 flow [2023-11-29 04:40:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-29 04:40:22,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2023-11-29 04:40:22,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-29 04:40:22,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-29 04:40:22,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:22,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-29 04:40:22,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:22,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:22,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:22,643 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 107 flow. Second operand 3 states and 134 transitions. [2023-11-29 04:40:22,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 145 flow [2023-11-29 04:40:22,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:22,645 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 104 flow [2023-11-29 04:40:22,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-11-29 04:40:22,646 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -12 predicate places. [2023-11-29 04:40:22,646 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 104 flow [2023-11-29 04:40:22,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:22,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:22,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:22,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:40:22,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:22,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1742153432, now seen corresponding path program 1 times [2023-11-29 04:40:22,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:22,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421552782] [2023-11-29 04:40:22,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:22,750 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 04:40:22,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421552782] [2023-11-29 04:40:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421552782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:22,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:40:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330455168] [2023-11-29 04:40:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:22,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:22,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:22,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:22,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-29 04:40:22,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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 04:40:22,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:22,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-29 04:40:22,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:22,905 INFO L124 PetriNetUnfolderBase]: 366/695 cut-off events. [2023-11-29 04:40:22,905 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 04:40:22,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 695 events. 366/695 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3359 event pairs, 136 based on Foata normal form. 15/611 useless extension candidates. Maximal degree in co-relation 1152. Up to 442 conditions per place. [2023-11-29 04:40:22,912 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 18 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-29 04:40:22,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 138 flow [2023-11-29 04:40:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 04:40:22,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2023-11-29 04:40:22,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 04:40:22,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 04:40:22,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:22,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 04:40:22,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 04:40:22,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:22,916 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:22,916 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 104 flow. Second operand 3 states and 138 transitions. [2023-11-29 04:40:22,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 138 flow [2023-11-29 04:40:22,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 137 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:22,917 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 101 flow [2023-11-29 04:40:22,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-11-29 04:40:22,918 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -13 predicate places. [2023-11-29 04:40:22,919 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 101 flow [2023-11-29 04:40:22,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 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 04:40:22,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:22,919 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] [2023-11-29 04:40:22,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:40:22,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:22,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 606349923, now seen corresponding path program 1 times [2023-11-29 04:40:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:22,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054917431] [2023-11-29 04:40:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:22,991 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 04:40:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:22,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054917431] [2023-11-29 04:40:22,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054917431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:22,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:22,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:40:22,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277259248] [2023-11-29 04:40:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:22,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:22,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:23,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-29 04:40:23,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 04:40:23,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:23,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-29 04:40:23,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:23,189 INFO L124 PetriNetUnfolderBase]: 872/1433 cut-off events. [2023-11-29 04:40:23,189 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-29 04:40:23,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 1433 events. 872/1433 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6973 event pairs, 86 based on Foata normal form. 1/1288 useless extension candidates. Maximal degree in co-relation 2548. Up to 1025 conditions per place. [2023-11-29 04:40:23,203 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 32 selfloop transitions, 7 changer transitions 1/61 dead transitions. [2023-11-29 04:40:23,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 220 flow [2023-11-29 04:40:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 04:40:23,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8172043010752689 [2023-11-29 04:40:23,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 04:40:23,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 04:40:23,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:23,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 04:40:23,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 04:40:23,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:23,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:23,207 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 101 flow. Second operand 3 states and 152 transitions. [2023-11-29 04:40:23,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 220 flow [2023-11-29 04:40:23,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:23,210 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 147 flow [2023-11-29 04:40:23,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-11-29 04:40:23,211 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2023-11-29 04:40:23,211 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 147 flow [2023-11-29 04:40:23,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 04:40:23,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:23,212 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] [2023-11-29 04:40:23,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:40:23,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:23,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash 107185241, now seen corresponding path program 1 times [2023-11-29 04:40:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152532453] [2023-11-29 04:40:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:40:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:23,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152532453] [2023-11-29 04:40:23,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152532453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:23,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:23,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:40:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988544188] [2023-11-29 04:40:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:23,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:23,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:23,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:23,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 62 [2023-11-29 04:40:23,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:23,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:23,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 62 [2023-11-29 04:40:23,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:23,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 52#thread3EXITtrue, 4#L121-4true, 93#true]) [2023-11-29 04:40:23,433 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-29 04:40:23,433 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 04:40:23,433 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-29 04:40:23,433 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 04:40:23,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][26], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 52#thread3EXITtrue, 4#L121-4true, 93#true]) [2023-11-29 04:40:23,433 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-29 04:40:23,434 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 04:40:23,434 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-29 04:40:23,434 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 04:40:23,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 52#thread3EXITtrue, 93#true]) [2023-11-29 04:40:23,447 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 04:40:23,447 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 04:40:23,447 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 04:40:23,447 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-29 04:40:23,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][26], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 52#thread3EXITtrue, 93#true]) [2023-11-29 04:40:23,448 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 04:40:23,448 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-29 04:40:23,448 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 04:40:23,448 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 04:40:23,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 14#L94true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 100#(= ~g2~0 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 43#L50true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 22#$Ultimate##0true, 93#true]) [2023-11-29 04:40:23,457 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 04:40:23,457 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 04:40:23,457 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-29 04:40:23,457 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 04:40:23,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][26], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 14#L94true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 22#$Ultimate##0true, 93#true]) [2023-11-29 04:40:23,458 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 04:40:23,458 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 04:40:23,458 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-29 04:40:23,458 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 04:40:23,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 14#L94true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 93#true]) [2023-11-29 04:40:23,478 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 04:40:23,478 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 04:40:23,479 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 04:40:23,479 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 04:40:23,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][26], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 14#L94true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 93#true]) [2023-11-29 04:40:23,479 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-29 04:40:23,479 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 04:40:23,479 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-29 04:40:23,479 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 04:40:23,503 INFO L124 PetriNetUnfolderBase]: 710/1219 cut-off events. [2023-11-29 04:40:23,503 INFO L125 PetriNetUnfolderBase]: For 258/312 co-relation queries the response was YES. [2023-11-29 04:40:23,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 1219 events. 710/1219 cut-off events. For 258/312 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5968 event pairs, 78 based on Foata normal form. 46/1092 useless extension candidates. Maximal degree in co-relation 2447. Up to 466 conditions per place. [2023-11-29 04:40:23,516 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 04:40:23,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 239 flow [2023-11-29 04:40:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-29 04:40:23,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8279569892473119 [2023-11-29 04:40:23,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-29 04:40:23,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-29 04:40:23,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:23,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-29 04:40:23,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:23,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:23,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:23,519 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 147 flow. Second operand 3 states and 154 transitions. [2023-11-29 04:40:23,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 239 flow [2023-11-29 04:40:23,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:23,522 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 150 flow [2023-11-29 04:40:23,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2023-11-29 04:40:23,523 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-29 04:40:23,523 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 150 flow [2023-11-29 04:40:23,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:23,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:23,524 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] [2023-11-29 04:40:23,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:40:23,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:23,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1651099231, now seen corresponding path program 1 times [2023-11-29 04:40:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:23,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455054606] [2023-11-29 04:40:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:40:23,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:23,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455054606] [2023-11-29 04:40:23,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455054606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:23,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:23,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:40:23,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919224702] [2023-11-29 04:40:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:23,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:23,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:23,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:23,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 62 [2023-11-29 04:40:23,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 04:40:23,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:23,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 62 [2023-11-29 04:40:23,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:23,816 INFO L124 PetriNetUnfolderBase]: 792/1332 cut-off events. [2023-11-29 04:40:23,816 INFO L125 PetriNetUnfolderBase]: For 482/698 co-relation queries the response was YES. [2023-11-29 04:40:23,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 1332 events. 792/1332 cut-off events. For 482/698 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6713 event pairs, 102 based on Foata normal form. 47/1160 useless extension candidates. Maximal degree in co-relation 2976. Up to 619 conditions per place. [2023-11-29 04:40:23,831 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 04:40:23,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 259 flow [2023-11-29 04:40:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2023-11-29 04:40:23,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-29 04:40:23,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 155 transitions. [2023-11-29 04:40:23,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 155 transitions. [2023-11-29 04:40:23,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:23,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 155 transitions. [2023-11-29 04:40:23,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:23,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:23,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:23,842 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 150 flow. Second operand 3 states and 155 transitions. [2023-11-29 04:40:23,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 259 flow [2023-11-29 04:40:23,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:23,845 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 160 flow [2023-11-29 04:40:23,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-11-29 04:40:23,846 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-29 04:40:23,846 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 160 flow [2023-11-29 04:40:23,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 04:40:23,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:23,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:23,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:40:23,847 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:23,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1253021295, now seen corresponding path program 1 times [2023-11-29 04:40:23,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:23,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147269561] [2023-11-29 04:40:23,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147269561] [2023-11-29 04:40:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147269561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:23,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:40:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188863541] [2023-11-29 04:40:23,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:23,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:23,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 62 [2023-11-29 04:40:23,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 04:40:23,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:23,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 62 [2023-11-29 04:40:23,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:24,175 INFO L124 PetriNetUnfolderBase]: 942/1557 cut-off events. [2023-11-29 04:40:24,175 INFO L125 PetriNetUnfolderBase]: For 655/771 co-relation queries the response was YES. [2023-11-29 04:40:24,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 1557 events. 942/1557 cut-off events. For 655/771 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7724 event pairs, 181 based on Foata normal form. 48/1311 useless extension candidates. Maximal degree in co-relation 3571. Up to 575 conditions per place. [2023-11-29 04:40:24,193 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 04:40:24,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 273 flow [2023-11-29 04:40:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2023-11-29 04:40:24,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8225806451612904 [2023-11-29 04:40:24,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 153 transitions. [2023-11-29 04:40:24,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 153 transitions. [2023-11-29 04:40:24,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:24,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 153 transitions. [2023-11-29 04:40:24,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 04:40:24,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:24,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:24,230 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 160 flow. Second operand 3 states and 153 transitions. [2023-11-29 04:40:24,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 273 flow [2023-11-29 04:40:24,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:24,234 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 170 flow [2023-11-29 04:40:24,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-11-29 04:40:24,235 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-11-29 04:40:24,235 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 170 flow [2023-11-29 04:40:24,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 04:40:24,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:24,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:24,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:40:24,236 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:24,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1333071905, now seen corresponding path program 1 times [2023-11-29 04:40:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:24,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357914350] [2023-11-29 04:40:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:24,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357914350] [2023-11-29 04:40:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357914350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:40:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470204481] [2023-11-29 04:40:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:24,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:24,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 62 [2023-11-29 04:40:24,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:24,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:24,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 62 [2023-11-29 04:40:24,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:24,586 INFO L124 PetriNetUnfolderBase]: 1081/1701 cut-off events. [2023-11-29 04:40:24,587 INFO L125 PetriNetUnfolderBase]: For 891/1009 co-relation queries the response was YES. [2023-11-29 04:40:24,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4245 conditions, 1701 events. 1081/1701 cut-off events. For 891/1009 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8072 event pairs, 190 based on Foata normal form. 31/1480 useless extension candidates. Maximal degree in co-relation 4226. Up to 756 conditions per place. [2023-11-29 04:40:24,603 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 34 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 04:40:24,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 278 flow [2023-11-29 04:40:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:40:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2023-11-29 04:40:24,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8118279569892473 [2023-11-29 04:40:24,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 151 transitions. [2023-11-29 04:40:24,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 151 transitions. [2023-11-29 04:40:24,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:24,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 151 transitions. [2023-11-29 04:40:24,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 04:40:24,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:24,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 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 04:40:24,607 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 170 flow. Second operand 3 states and 151 transitions. [2023-11-29 04:40:24,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 278 flow [2023-11-29 04:40:24,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:24,610 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 172 flow [2023-11-29 04:40:24,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-11-29 04:40:24,610 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-29 04:40:24,611 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 172 flow [2023-11-29 04:40:24,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:24,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:24,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:24,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:40:24,611 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:24,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 304995005, now seen corresponding path program 1 times [2023-11-29 04:40:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:24,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360596900] [2023-11-29 04:40:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:24,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:40:24,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360596900] [2023-11-29 04:40:24,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360596900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:24,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:24,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:40:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243336879] [2023-11-29 04:40:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:24,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:40:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:24,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:40:24,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:40:24,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-29 04:40:24,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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 04:40:24,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:24,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-29 04:40:24,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:25,352 INFO L124 PetriNetUnfolderBase]: 2117/3306 cut-off events. [2023-11-29 04:40:25,352 INFO L125 PetriNetUnfolderBase]: For 2019/2069 co-relation queries the response was YES. [2023-11-29 04:40:25,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8465 conditions, 3306 events. 2117/3306 cut-off events. For 2019/2069 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17894 event pairs, 402 based on Foata normal form. 65/2933 useless extension candidates. Maximal degree in co-relation 8444. Up to 1105 conditions per place. [2023-11-29 04:40:25,382 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 50 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-11-29 04:40:25,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 382 flow [2023-11-29 04:40:25,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:40:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:40:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2023-11-29 04:40:25,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8225806451612904 [2023-11-29 04:40:25,384 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 204 transitions. [2023-11-29 04:40:25,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 204 transitions. [2023-11-29 04:40:25,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:25,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 204 transitions. [2023-11-29 04:40:25,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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 04:40:25,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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 04:40:25,386 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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 04:40:25,386 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 172 flow. Second operand 4 states and 204 transitions. [2023-11-29 04:40:25,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 382 flow [2023-11-29 04:40:25,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:40:25,389 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 200 flow [2023-11-29 04:40:25,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2023-11-29 04:40:25,390 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-11-29 04:40:25,390 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 200 flow [2023-11-29 04:40:25,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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 04:40:25,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:25,391 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:25,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:40:25,391 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:25,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash -96069121, now seen corresponding path program 1 times [2023-11-29 04:40:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:25,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918201279] [2023-11-29 04:40:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 04:40:25,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918201279] [2023-11-29 04:40:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918201279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:40:25,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713906780] [2023-11-29 04:40:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:25,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:40:25,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:40:25,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:40:25,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:40:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:25,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:40:25,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:40:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 04:40:25,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:40:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:40:26,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713906780] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:40:26,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:40:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 7] total 13 [2023-11-29 04:40:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66380545] [2023-11-29 04:40:26,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:40:26,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:40:26,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:26,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:40:26,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:40:26,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 62 [2023-11-29 04:40:26,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 200 flow. Second operand has 14 states, 14 states have (on average 38.0) internal successors, (532), 14 states have internal predecessors, (532), 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 04:40:26,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:26,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 62 [2023-11-29 04:40:26,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:28,341 INFO L124 PetriNetUnfolderBase]: 10518/16031 cut-off events. [2023-11-29 04:40:28,341 INFO L125 PetriNetUnfolderBase]: For 14441/14442 co-relation queries the response was YES. [2023-11-29 04:40:28,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43530 conditions, 16031 events. 10518/16031 cut-off events. For 14441/14442 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 103124 event pairs, 669 based on Foata normal form. 1374/16338 useless extension candidates. Maximal degree in co-relation 43507. Up to 3663 conditions per place. [2023-11-29 04:40:28,477 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 173 selfloop transitions, 65 changer transitions 0/258 dead transitions. [2023-11-29 04:40:28,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 258 transitions, 1448 flow [2023-11-29 04:40:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:40:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-29 04:40:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 814 transitions. [2023-11-29 04:40:28,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7722960151802657 [2023-11-29 04:40:28,482 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 814 transitions. [2023-11-29 04:40:28,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 814 transitions. [2023-11-29 04:40:28,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:28,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 814 transitions. [2023-11-29 04:40:28,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 47.88235294117647) internal successors, (814), 17 states have internal predecessors, (814), 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 04:40:28,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 62.0) internal successors, (1116), 18 states have internal predecessors, (1116), 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 04:40:28,488 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 62.0) internal successors, (1116), 18 states have internal predecessors, (1116), 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 04:40:28,488 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 200 flow. Second operand 17 states and 814 transitions. [2023-11-29 04:40:28,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 258 transitions, 1448 flow [2023-11-29 04:40:28,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 258 transitions, 1425 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:28,536 INFO L231 Difference]: Finished difference. Result has 92 places, 114 transitions, 811 flow [2023-11-29 04:40:28,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=811, PETRI_PLACES=92, PETRI_TRANSITIONS=114} [2023-11-29 04:40:28,537 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2023-11-29 04:40:28,537 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 114 transitions, 811 flow [2023-11-29 04:40:28,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.0) internal successors, (532), 14 states have internal predecessors, (532), 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 04:40:28,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:28,538 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:28,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:40:28,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:40:28,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:28,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2095000861, now seen corresponding path program 1 times [2023-11-29 04:40:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011351089] [2023-11-29 04:40:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 04:40:29,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:29,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011351089] [2023-11-29 04:40:29,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011351089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:29,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:29,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:40:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728661040] [2023-11-29 04:40:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:29,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:40:29,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:29,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:40:29,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:40:29,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-29 04:40:29,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 114 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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 04:40:29,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:29,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-29 04:40:29,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:30,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[][20], [189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 50#L66true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 45#L88true, Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 23#L48true, 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,095 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,096 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,096 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 04:40:30,096 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 04:40:30,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][24], [189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 8#L72true, Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 14#L94true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,122 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 04:40:30,122 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,122 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,122 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 30#L53-1true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,220 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-29 04:40:30,220 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:40:30,220 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:40:30,220 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:40:30,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 30#L53-1true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,220 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 04:40:30,221 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,221 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,221 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,298 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][24], [189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), 8#L72true, Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 14#L94true, 43#L50true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,298 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 04:40:30,298 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:40:30,298 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,298 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,298 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [30#L53-1true, 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,318 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 04:40:30,318 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,318 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,318 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [30#L53-1true, 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,318 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 04:40:30,319 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,319 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,319 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,322 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 04:40:30,322 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,322 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,322 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:40:30,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,323 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 04:40:30,323 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,323 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,323 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,394 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 04:40:30,395 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,395 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,395 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,395 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 04:40:30,395 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,395 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,395 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,478 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 04:40:30,478 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,478 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,478 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:40:30,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,478 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 04:40:30,478 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,479 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,479 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,551 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 04:40:30,552 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,552 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,552 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:40:30,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,552 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 04:40:30,552 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:40:30,552 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:40:30,552 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:40:30,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 32#L122-2true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,666 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 04:40:30,666 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:40:30,666 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:40:30,666 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:40:30,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 32#L122-2true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:30,667 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:40:30,667 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:40:30,667 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:40:30,667 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:40:31,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [30#L53-1true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,233 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-29 04:40:31,233 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:40:31,233 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:40:31,233 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:40:31,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [30#L53-1true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,250 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-29 04:40:31,250 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,250 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,250 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [42#thread1EXITtrue, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,251 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-29 04:40:31,252 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,252 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,252 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [30#L53-1true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,253 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-29 04:40:31,253 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,253 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,253 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:40:31,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,262 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-29 04:40:31,262 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,262 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,262 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][47], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 14#L94true, 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,263 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-29 04:40:31,263 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,263 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,263 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [42#thread1EXITtrue, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,266 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-29 04:40:31,266 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,267 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,267 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [30#L53-1true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,268 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-29 04:40:31,268 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,268 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,268 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [42#thread1EXITtrue, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,269 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-29 04:40:31,269 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,269 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,269 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:40:31,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,273 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-29 04:40:31,273 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,273 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,273 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][47], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 14#L94true, 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,274 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-29 04:40:31,274 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,274 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,274 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 48#thread2EXITtrue, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,276 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-29 04:40:31,276 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,276 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,276 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][47], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 48#thread2EXITtrue, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 14#L94true, Black: 105#(= ~g1~0 1), 43#L50true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,276 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-29 04:40:31,276 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,276 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,276 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [42#thread1EXITtrue, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,279 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-29 04:40:31,279 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,279 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,279 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:40:31,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,286 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-29 04:40:31,286 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,286 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,286 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][47], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 14#L94true, Black: 105#(= ~g1~0 1), 43#L50true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,287 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-29 04:40:31,287 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,287 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,287 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [32#L122-2true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,288 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-29 04:40:31,288 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,288 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,288 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:40:31,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 32#L122-2true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,291 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-29 04:40:31,291 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-29 04:40:31,291 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-29 04:40:31,291 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-29 04:40:31,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 37#L123-2true, Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:40:31,293 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-29 04:40:31,293 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-29 04:40:31,293 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-29 04:40:31,293 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-29 04:40:31,294 INFO L124 PetriNetUnfolderBase]: 10908/17724 cut-off events. [2023-11-29 04:40:31,294 INFO L125 PetriNetUnfolderBase]: For 93286/95762 co-relation queries the response was YES. [2023-11-29 04:40:31,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74157 conditions, 17724 events. 10908/17724 cut-off events. For 93286/95762 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 128463 event pairs, 3163 based on Foata normal form. 614/16386 useless extension candidates. Maximal degree in co-relation 74118. Up to 5930 conditions per place. [2023-11-29 04:40:31,493 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 146 selfloop transitions, 15 changer transitions 0/195 dead transitions. [2023-11-29 04:40:31,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 195 transitions, 1805 flow [2023-11-29 04:40:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:40:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:40:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2023-11-29 04:40:31,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8225806451612904 [2023-11-29 04:40:31,494 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 204 transitions. [2023-11-29 04:40:31,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 204 transitions. [2023-11-29 04:40:31,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:31,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 204 transitions. [2023-11-29 04:40:31,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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 04:40:31,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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 04:40:31,496 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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 04:40:31,497 INFO L175 Difference]: Start difference. First operand has 92 places, 114 transitions, 811 flow. Second operand 4 states and 204 transitions. [2023-11-29 04:40:31,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 195 transitions, 1805 flow [2023-11-29 04:40:31,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 195 transitions, 1762 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-11-29 04:40:31,548 INFO L231 Difference]: Finished difference. Result has 96 places, 117 transitions, 878 flow [2023-11-29 04:40:31,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=878, PETRI_PLACES=96, PETRI_TRANSITIONS=117} [2023-11-29 04:40:31,549 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2023-11-29 04:40:31,549 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 117 transitions, 878 flow [2023-11-29 04:40:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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 04:40:31,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:31,549 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:31,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:40:31,550 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:31,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash 215855855, now seen corresponding path program 1 times [2023-11-29 04:40:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:31,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275768837] [2023-11-29 04:40:31,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:40:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275768837] [2023-11-29 04:40:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275768837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:40:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638053316] [2023-11-29 04:40:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:31,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:40:31,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:40:31,823 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:40:31,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:40:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:31,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:40:31,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:40:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:40:32,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:40:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:40:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638053316] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:40:32,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:40:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-29 04:40:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688519017] [2023-11-29 04:40:32,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:40:32,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:40:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:40:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:40:32,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-29 04:40:32,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 117 transitions, 878 flow. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 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 04:40:32,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:32,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-29 04:40:32,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:39,919 INFO L124 PetriNetUnfolderBase]: 36467/61034 cut-off events. [2023-11-29 04:40:39,920 INFO L125 PetriNetUnfolderBase]: For 305335/311070 co-relation queries the response was YES. [2023-11-29 04:40:40,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258557 conditions, 61034 events. 36467/61034 cut-off events. For 305335/311070 co-relation queries the response was YES. Maximal size of possible extension queue 1698. Compared 522838 event pairs, 6118 based on Foata normal form. 1233/60291 useless extension candidates. Maximal degree in co-relation 258515. Up to 17281 conditions per place. [2023-11-29 04:40:40,499 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 332 selfloop transitions, 28 changer transitions 1/394 dead transitions. [2023-11-29 04:40:40,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 394 transitions, 3822 flow [2023-11-29 04:40:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:40:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:40:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 329 transitions. [2023-11-29 04:40:40,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8844086021505376 [2023-11-29 04:40:40,501 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 329 transitions. [2023-11-29 04:40:40,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 329 transitions. [2023-11-29 04:40:40,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:40,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 329 transitions. [2023-11-29 04:40:40,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 54.833333333333336) internal successors, (329), 6 states have internal predecessors, (329), 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 04:40:40,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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 04:40:40,504 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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 04:40:40,504 INFO L175 Difference]: Start difference. First operand has 96 places, 117 transitions, 878 flow. Second operand 6 states and 329 transitions. [2023-11-29 04:40:40,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 394 transitions, 3822 flow [2023-11-29 04:40:40,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 394 transitions, 3812 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-11-29 04:40:40,700 INFO L231 Difference]: Finished difference. Result has 102 places, 141 transitions, 1055 flow [2023-11-29 04:40:40,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=102, PETRI_TRANSITIONS=141} [2023-11-29 04:40:40,701 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 40 predicate places. [2023-11-29 04:40:40,701 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 141 transitions, 1055 flow [2023-11-29 04:40:40,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 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 04:40:40,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:40,701 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:40,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:40:40,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 04:40:40,902 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:40,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -403119027, now seen corresponding path program 2 times [2023-11-29 04:40:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:40,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926185465] [2023-11-29 04:40:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:40,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926185465] [2023-11-29 04:40:41,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926185465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:40:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932180432] [2023-11-29 04:40:41,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:40:41,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:40:41,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:40:41,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:40:41,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:40:41,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:40:41,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:40:41,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:40:41,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:40:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:41,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:40:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:41,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932180432] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:40:41,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:40:41,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2023-11-29 04:40:41,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383813066] [2023-11-29 04:40:41,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:40:41,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:40:41,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:40:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:40:41,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-29 04:40:41,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 141 transitions, 1055 flow. Second operand has 7 states, 7 states have (on average 40.714285714285715) internal successors, (285), 7 states have internal predecessors, (285), 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 04:40:41,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:41,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-29 04:40:41,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:40:57,561 INFO L124 PetriNetUnfolderBase]: 70839/119066 cut-off events. [2023-11-29 04:40:57,561 INFO L125 PetriNetUnfolderBase]: For 637441/650367 co-relation queries the response was YES. [2023-11-29 04:40:58,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535249 conditions, 119066 events. 70839/119066 cut-off events. For 637441/650367 co-relation queries the response was YES. Maximal size of possible extension queue 3509. Compared 1124302 event pairs, 11996 based on Foata normal form. 3237/118538 useless extension candidates. Maximal degree in co-relation 535204. Up to 33472 conditions per place. [2023-11-29 04:40:58,882 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 396 selfloop transitions, 58 changer transitions 1/488 dead transitions. [2023-11-29 04:40:58,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 488 transitions, 4798 flow [2023-11-29 04:40:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:40:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:40:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 387 transitions. [2023-11-29 04:40:58,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8917050691244239 [2023-11-29 04:40:58,885 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 387 transitions. [2023-11-29 04:40:58,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 387 transitions. [2023-11-29 04:40:58,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:40:58,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 387 transitions. [2023-11-29 04:40:58,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 55.285714285714285) internal successors, (387), 7 states have internal predecessors, (387), 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 04:40:58,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 62.0) internal successors, (496), 8 states have internal predecessors, (496), 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 04:40:58,888 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 62.0) internal successors, (496), 8 states have internal predecessors, (496), 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 04:40:58,888 INFO L175 Difference]: Start difference. First operand has 102 places, 141 transitions, 1055 flow. Second operand 7 states and 387 transitions. [2023-11-29 04:40:58,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 488 transitions, 4798 flow [2023-11-29 04:40:59,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 488 transitions, 4690 flow, removed 54 selfloop flow, removed 0 redundant places. [2023-11-29 04:40:59,325 INFO L231 Difference]: Finished difference. Result has 109 places, 171 transitions, 1279 flow [2023-11-29 04:40:59,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1279, PETRI_PLACES=109, PETRI_TRANSITIONS=171} [2023-11-29 04:40:59,326 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 47 predicate places. [2023-11-29 04:40:59,326 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 171 transitions, 1279 flow [2023-11-29 04:40:59,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 40.714285714285715) internal successors, (285), 7 states have internal predecessors, (285), 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 04:40:59,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:40:59,326 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:40:59,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:40:59,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 04:40:59,527 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:40:59,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1776605061, now seen corresponding path program 3 times [2023-11-29 04:40:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:40:59,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047040231] [2023-11-29 04:40:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:40:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:59,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:40:59,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047040231] [2023-11-29 04:40:59,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047040231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:40:59,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62363520] [2023-11-29 04:40:59,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:40:59,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:40:59,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:40:59,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:40:59,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:40:59,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 04:40:59,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:40:59,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:40:59,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:40:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:59,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:40:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:59,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62363520] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:40:59,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:40:59,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-11-29 04:40:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630406020] [2023-11-29 04:40:59,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:40:59,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:40:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:40:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:40:59,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:40:59,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-29 04:40:59,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 171 transitions, 1279 flow. Second operand has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 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 04:40:59,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:40:59,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-29 04:40:59,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:41:26,459 INFO L124 PetriNetUnfolderBase]: 111097/186795 cut-off events. [2023-11-29 04:41:26,459 INFO L125 PetriNetUnfolderBase]: For 1010988/1029713 co-relation queries the response was YES. [2023-11-29 04:41:27,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846151 conditions, 186795 events. 111097/186795 cut-off events. For 1010988/1029713 co-relation queries the response was YES. Maximal size of possible extension queue 5765. Compared 1871032 event pairs, 18373 based on Foata normal form. 5344/186280 useless extension candidates. Maximal degree in co-relation 846103. Up to 44413 conditions per place. [2023-11-29 04:41:28,781 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 467 selfloop transitions, 94 changer transitions 1/595 dead transitions. [2023-11-29 04:41:28,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 595 transitions, 5891 flow [2023-11-29 04:41:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:41:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:41:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 445 transitions. [2023-11-29 04:41:28,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8971774193548387 [2023-11-29 04:41:28,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 445 transitions. [2023-11-29 04:41:28,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 445 transitions. [2023-11-29 04:41:28,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:41:28,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 445 transitions. [2023-11-29 04:41:28,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 55.625) internal successors, (445), 8 states have internal predecessors, (445), 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 04:41:28,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 62.0) internal successors, (558), 9 states have internal predecessors, (558), 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 04:41:28,787 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 62.0) internal successors, (558), 9 states have internal predecessors, (558), 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 04:41:28,787 INFO L175 Difference]: Start difference. First operand has 109 places, 171 transitions, 1279 flow. Second operand 8 states and 445 transitions. [2023-11-29 04:41:28,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 595 transitions, 5891 flow [2023-11-29 04:41:30,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 595 transitions, 5770 flow, removed 54 selfloop flow, removed 1 redundant places. [2023-11-29 04:41:30,107 INFO L231 Difference]: Finished difference. Result has 116 places, 207 transitions, 1617 flow [2023-11-29 04:41:30,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1617, PETRI_PLACES=116, PETRI_TRANSITIONS=207} [2023-11-29 04:41:30,108 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 54 predicate places. [2023-11-29 04:41:30,108 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 207 transitions, 1617 flow [2023-11-29 04:41:30,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 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 04:41:30,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:41:30,108 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:30,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:41:30,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 04:41:30,309 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 04:41:30,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1688607437, now seen corresponding path program 4 times [2023-11-29 04:41:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:41:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085512131] [2023-11-29 04:41:30,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:41:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:41:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:41:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085512131] [2023-11-29 04:41:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085512131] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:41:30,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093633856] [2023-11-29 04:41:30,751 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:41:30,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:41:30,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:41:30,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:41:30,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa8d2732-20c1-4d46-ac4f-4c5467edd752/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:41:30,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:41:30,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:41:30,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:41:30,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:41:31,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:41:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 04:41:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093633856] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:41:31,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:41:31,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 8] total 16 [2023-11-29 04:41:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152666979] [2023-11-29 04:41:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:31,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:41:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:41:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:41:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:41:31,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 62 [2023-11-29 04:41:31,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 207 transitions, 1617 flow. Second operand has 7 states, 7 states have (on average 40.142857142857146) internal successors, (281), 7 states have internal predecessors, (281), 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 04:41:31,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:41:31,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 62 [2023-11-29 04:41:31,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:41:44,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][343], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 105#(= ~g1~0 1), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 425#(= ~g1~0 1), 434#(= ~pos~0 3), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 1039#(= ~pos~0 3), 736#(= ~pos~0 3), Black: 115#(= ~d3~0 1), 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:41:44,069 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-29 04:41:44,069 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:41:44,069 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:41:44,069 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-29 04:41:50,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][416], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), 434#(= ~pos~0 3), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 1039#(= ~pos~0 3), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 736#(= ~pos~0 3), Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:41:50,317 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 04:41:50,317 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:41:50,317 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:41:50,317 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:41:53,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][82], [170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 1035#true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 58#L92true, Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), 8#L72true, Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 43#L50true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:41:53,664 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 04:41:53,664 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:41:53,664 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:41:53,665 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:41:55,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][136], [20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:41:55,929 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 04:41:55,929 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:41:55,929 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:41:55,929 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:41:57,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L87-->L88: Formula: (not (= (mod v_~d3~0_1 256) 0)) InVars {~d3~0=v_~d3~0_1} OutVars{~d3~0=v_~d3~0_1} AuxVars[] AssignedVars[][55], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 1674#(and (not (= (mod ~g1~0 256) 0)) (or (not (= (mod ~d1~0 256) 0)) (< 0 (mod ~d3~0 256)))), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 1039#(= ~pos~0 3), Black: 115#(= ~d3~0 1), 732#true, 28#L70true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:41:57,113 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:41:57,113 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:41:57,113 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:41:57,113 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:41:57,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[][21], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 23#L48true, 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 1039#(= ~pos~0 3), Black: 115#(= ~d3~0 1), 732#true, 28#L70true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:41:57,114 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:41:57,114 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:41:57,114 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:41:57,114 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:41:57,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][82], [170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 1035#true, 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 58#L92true, Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), 8#L72true, Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 105#(= ~g1~0 1), 43#L50true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:41:57,734 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 04:41:57,734 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:41:57,734 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:41:57,734 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:41:57,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][396], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 58#L92true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:41:57,741 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-11-29 04:41:57,741 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-29 04:41:57,741 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-29 04:41:57,741 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-11-29 04:42:00,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][136], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 23#L48true, Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:00,229 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:00,229 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,229 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,229 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][135], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 14#L94true, 1041#(= ~pos~0 4), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 4#L121-4true, 732#true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:00,230 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:00,230 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,230 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,230 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][136], [20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:00,235 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:00,235 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,235 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,235 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][134], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 1035#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 14#L94true, 53#L75-1true, Black: 105#(= ~g1~0 1), 43#L50true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 4#L121-4true, 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:00,238 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:00,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][176], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 7#L44true, 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:00,238 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:00,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,238 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:00,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][329], [30#L53-1true, 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1042#(= ~pos~0 2), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), 1339#true, Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), 737#(= ~pos~0 2), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 435#(= ~pos~0 2), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:00,509 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 04:42:00,509 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:42:00,509 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:42:00,509 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 04:42:01,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][125], [170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 8#L72true, Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:01,767 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 04:42:01,767 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:42:01,767 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:42:01,767 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:42:01,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][396], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 7#L44true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 58#L92true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:01,959 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2023-11-29 04:42:01,959 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-29 04:42:01,959 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-29 04:42:01,959 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-11-29 04:42:03,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][136], [20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 1040#(= 5 ~pos~0), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, 28#L70true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:03,501 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:03,501 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:03,501 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:03,501 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][136], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 23#L48true, Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:04,864 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:04,864 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,864 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,864 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][135], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 14#L94true, 1041#(= ~pos~0 4), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 732#true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:04,864 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:04,864 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,864 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,864 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][134], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 1035#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 100#(= ~g2~0 1), 14#L94true, 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:04,873 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:04,873 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,873 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,873 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][176], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 1040#(= 5 ~pos~0), 7#L44true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:04,873 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:04,873 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,873 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:04,873 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:05,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][260], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:05,030 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,030 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:05,030 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:05,030 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:05,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][329], [30#L53-1true, 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1042#(= ~pos~0 2), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), 1339#true, Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), 737#(= ~pos~0 2), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 435#(= ~pos~0 2), Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:05,103 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,103 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,103 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,103 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][260], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1042#(= ~pos~0 2), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), 737#(= ~pos~0 2), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 435#(= ~pos~0 2), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:05,130 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,131 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,131 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,131 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][329], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1042#(= ~pos~0 2), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), 1339#true, Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 737#(= ~pos~0 2), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 435#(= ~pos~0 2), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:05,131 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,131 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,131 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,131 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 04:42:05,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[][21], [425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 50#L66true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 49#L87true, Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 23#L48true, Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), 434#(= ~pos~0 3), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 1039#(= ~pos~0 3), 736#(= ~pos~0 3), Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:05,568 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,568 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,568 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,568 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][370], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 105#(= ~g1~0 1), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:05,588 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,588 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,588 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:42:05,588 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-29 04:42:06,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][125], [170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 430#true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 8#L72true, Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:06,286 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-29 04:42:06,286 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:06,287 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:06,287 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:06,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][149], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 738#(= ~pos~0 4), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 1041#(= ~pos~0 4), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:06,754 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:06,754 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:06,754 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:06,754 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:07,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][346], [30#L53-1true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 1040#(= 5 ~pos~0), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 14#L94true, 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:07,444 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 04:42:07,444 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:42:07,444 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:42:07,444 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:42:08,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][136], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 1040#(= 5 ~pos~0), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 23#L48true, Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, 28#L70true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:08,518 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 04:42:08,518 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,518 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,518 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][135], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 120#(= ~g2~0 1), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 14#L94true, 1041#(= ~pos~0 4), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 4#L121-4true, 732#true, 28#L70true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:08,518 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 04:42:08,518 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,519 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,519 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][136], [20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 28#L70true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:08,532 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 04:42:08,532 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,532 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,532 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:08,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][362], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 1035#true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 23#L48true, Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:08,637 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:08,637 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:08,637 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:08,637 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:08,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][81], [299#(= (mod ~d2~0 256) 0), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 1035#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 8#L72true, Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:08,637 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:08,637 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:08,637 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:08,637 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:09,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][336], [20#L43true, 299#(= (mod ~d2~0 256) 0), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 120#(= ~g2~0 1), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, 28#L70true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:09,138 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 04:42:09,138 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 04:42:09,138 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:42:09,138 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 04:42:10,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][260], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 423#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:10,297 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:10,297 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:42:10,297 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:42:10,297 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:42:10,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][149], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, 7#L44true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 120#(= ~g2~0 1), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:10,355 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:10,355 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:42:10,355 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:42:10,355 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 04:42:10,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][260], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1042#(= ~pos~0 2), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), 737#(= ~pos~0 2), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 435#(= ~pos~0 2), Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:10,434 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:10,434 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:10,434 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:10,434 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:10,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][329], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1042#(= ~pos~0 2), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 1339#true, Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), 737#(= ~pos~0 2), Black: 425#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 435#(= ~pos~0 2), Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:10,435 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:10,435 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:10,435 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:10,435 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 04:42:10,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[][21], [425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 50#L66true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 49#L87true, Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 23#L48true, Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 1039#(= ~pos~0 3), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:10,918 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-11-29 04:42:10,918 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:10,918 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:10,918 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:10,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][416], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:10,986 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:10,987 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:10,987 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:10,987 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][343], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 105#(= ~g1~0 1), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 58#L92true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:11,030 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-11-29 04:42:11,030 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:11,031 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:11,031 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:11,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][439], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 30#L53-1true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:11,032 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,032 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,032 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,032 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][416], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 30#L53-1true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), 1474#(not (= (mod ~g1~0 256) 0)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:11,038 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-11-29 04:42:11,038 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:11,038 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:11,038 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-11-29 04:42:11,038 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][416], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, 1040#(= 5 ~pos~0), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:11,038 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,039 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,039 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,039 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,039 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-29 04:42:11,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[][21], [425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 50#L66true, Black: 734#(= ~pos~0 0), 1038#(= ~pos~0 1), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 735#(= ~pos~0 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 49#L87true, Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 23#L48true, Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:11,480 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-29 04:42:11,480 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:11,480 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:11,480 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:11,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][416], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 20#L43true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 1035#true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 14#L94true, 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:11,874 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-29 04:42:11,874 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:11,874 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:11,874 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:12,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L87-->L88: Formula: (not (= (mod v_~d3~0_1 256) 0)) InVars {~d3~0=v_~d3~0_1} OutVars{~d3~0=v_~d3~0_1} AuxVars[] AssignedVars[][34], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 734#(= ~pos~0 0), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 7#L44true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 45#L88true, Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 120#(= ~g2~0 1), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 1041#(= ~pos~0 4), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 732#true, 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), 28#L70true, Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:12,479 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-29 04:42:12,479 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:12,479 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:12,479 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 04:42:12,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][149], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, 7#L44true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 738#(= ~pos~0 4), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 1041#(= ~pos~0 4), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:12,510 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 04:42:12,510 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:12,510 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:12,510 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 04:42:13,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][346], [20#L43true, 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 1040#(= 5 ~pos~0), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 14#L94true, 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0))), 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1))]) [2023-11-29 04:42:13,169 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-29 04:42:13,169 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:13,169 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:13,169 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:13,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][415], [30#L53-1true, 299#(= (mod ~d2~0 256) 0), 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 1040#(= 5 ~pos~0), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, 1474#(not (= (mod ~g1~0 256) 0)), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 732#true, 12#L97-1true, Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:13,173 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-29 04:42:13,173 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:13,173 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:13,173 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 04:42:13,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][343], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 734#(= ~pos~0 0), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, 7#L44true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 430#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 738#(= ~pos~0 4), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 1041#(= ~pos~0 4), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 425#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 1467#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod ~g1~0 256) 0))), Black: 1037#(= ~pos~0 0), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-29 04:42:13,188 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-11-29 04:42:13,188 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-11-29 04:42:13,188 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-11-29 04:42:13,188 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event