./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1 --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 c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:19:01,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:19:01,664 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 10:19:01,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:19:01,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:19:01,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:19:01,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:19:01,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:19:01,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 10:19:01,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 10:19:01,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 10:19:01,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 10:19:01,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:19:01,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:19:01,693 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:19:01,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:19:01,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 10:19:01,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 10:19:01,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:19:01,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 10:19:01,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:19:01,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:19:01,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 10:19:01,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 10:19:01,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 10:19:01,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 10:19:01,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 10:19:01,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 10:19:01,696 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1 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 -> c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c [2024-12-02 10:19:01,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:19:01,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:19:01,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:19:01,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:19:01,942 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:19:01,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-12-02 10:19:04,563 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/data/61bae7ea6/9389e8c1bca9418f819d8a62c1a73e1b/FLAGf59ccd2ab [2024-12-02 10:19:04,758 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:19:04,758 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-12-02 10:19:04,763 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/data/61bae7ea6/9389e8c1bca9418f819d8a62c1a73e1b/FLAGf59ccd2ab [2024-12-02 10:19:04,774 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/data/61bae7ea6/9389e8c1bca9418f819d8a62c1a73e1b [2024-12-02 10:19:04,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:19:04,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:19:04,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:19:04,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:19:04,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:19:04,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:19:04" (1/1) ... [2024-12-02 10:19:04,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50f18bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:04, skipping insertion in model container [2024-12-02 10:19:04,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:19:04" (1/1) ... [2024-12-02 10:19:04,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:19:04,961 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-12-02 10:19:04,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:19:04,971 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:19:04,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:19:05,008 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:19:05,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05 WrapperNode [2024-12-02 10:19:05,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:19:05,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:19:05,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:19:05,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:19:05,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,047 INFO L138 Inliner]: procedures = 26, calls = 68, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 335 [2024-12-02 10:19:05,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:19:05,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:19:05,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:19:05,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:19:05,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,078 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-12-02 10:19:05,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:19:05,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:19:05,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:19:05,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:19:05,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (1/1) ... [2024-12-02 10:19:05,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:19:05,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:19:05,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 10:19:05,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 10:19:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 10:19:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-12-02 10:19:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-12-02 10:19:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-12-02 10:19:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-02 10:19:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-02 10:19:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-12-02 10:19:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-12-02 10:19:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-02 10:19:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:19:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:19:05,153 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 10:19:05,250 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:19:05,251 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:19:05,723 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 10:19:05,723 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:19:06,066 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:19:06,067 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2024-12-02 10:19:06,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:19:06 BoogieIcfgContainer [2024-12-02 10:19:06,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:19:06,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 10:19:06,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 10:19:06,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 10:19:06,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:19:04" (1/3) ... [2024-12-02 10:19:06,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2975dc72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:19:06, skipping insertion in model container [2024-12-02 10:19:06,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:19:05" (2/3) ... [2024-12-02 10:19:06,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2975dc72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:19:06, skipping insertion in model container [2024-12-02 10:19:06,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:19:06" (3/3) ... [2024-12-02 10:19:06,076 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2024-12-02 10:19:06,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 10:19:06,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series3.wvr.c that has 5 procedures, 71 locations, 1 initial locations, 7 loop locations, and 22 error locations. [2024-12-02 10:19:06,093 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 10:19:06,185 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-02 10:19:06,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 77 transitions, 182 flow [2024-12-02 10:19:06,259 INFO L124 PetriNetUnfolderBase]: 7/73 cut-off events. [2024-12-02 10:19:06,261 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-12-02 10:19:06,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 73 events. 7/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 191 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2024-12-02 10:19:06,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 77 transitions, 182 flow [2024-12-02 10:19:06,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 72 transitions, 168 flow [2024-12-02 10:19:06,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 10:19:06,287 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@28f9f994, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 10:19:06,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2024-12-02 10:19:06,290 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 10:19:06,290 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-12-02 10:19:06,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:19:06,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:06,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-12-02 10:19:06,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1045475, now seen corresponding path program 1 times [2024-12-02 10:19:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:06,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359008716] [2024-12-02 10:19:06,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359008716] [2024-12-02 10:19:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359008716] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:06,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 10:19:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960596733] [2024-12-02 10:19:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:06,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:19:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:06,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:19:06,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:19:06,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:06,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:06,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:06,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:06,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:09,593 INFO L124 PetriNetUnfolderBase]: 17936/24322 cut-off events. [2024-12-02 10:19:09,593 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2024-12-02 10:19:09,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47167 conditions, 24322 events. 17936/24322 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 161462 event pairs, 11530 based on Foata normal form. 1/12145 useless extension candidates. Maximal degree in co-relation 45060. Up to 21814 conditions per place. [2024-12-02 10:19:09,729 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 43 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-12-02 10:19:09,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 244 flow [2024-12-02 10:19:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:19:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:19:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-12-02 10:19:09,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-12-02 10:19:09,740 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 168 flow. Second operand 3 states and 126 transitions. [2024-12-02 10:19:09,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 244 flow [2024-12-02 10:19:09,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 228 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-12-02 10:19:09,775 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 142 flow [2024-12-02 10:19:09,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-12-02 10:19:09,780 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -13 predicate places. [2024-12-02 10:19:09,780 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 142 flow [2024-12-02 10:19:09,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:09,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:09,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-12-02 10:19:09,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 10:19:09,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1045476, now seen corresponding path program 1 times [2024-12-02 10:19:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16240324] [2024-12-02 10:19:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:10,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:10,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16240324] [2024-12-02 10:19:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16240324] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:10,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:10,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:19:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522840537] [2024-12-02 10:19:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:10,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:19:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:10,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:19:10,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:19:10,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:10,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:10,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:10,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:10,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:12,046 INFO L124 PetriNetUnfolderBase]: 17937/24325 cut-off events. [2024-12-02 10:19:12,046 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-12-02 10:19:12,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46551 conditions, 24325 events. 17937/24325 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 161719 event pairs, 11530 based on Foata normal form. 0/12144 useless extension candidates. Maximal degree in co-relation 46514. Up to 21827 conditions per place. [2024-12-02 10:19:12,149 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 47 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-12-02 10:19:12,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 250 flow [2024-12-02 10:19:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:19:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 10:19:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2024-12-02 10:19:12,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4935064935064935 [2024-12-02 10:19:12,152 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 142 flow. Second operand 4 states and 152 transitions. [2024-12-02 10:19:12,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 250 flow [2024-12-02 10:19:12,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:19:12,155 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 165 flow [2024-12-02 10:19:12,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-12-02 10:19:12,156 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2024-12-02 10:19:12,156 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 165 flow [2024-12-02 10:19:12,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:12,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:12,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 10:19:12,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 10:19:12,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:12,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash 32412952, now seen corresponding path program 1 times [2024-12-02 10:19:12,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:12,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927649016] [2024-12-02 10:19:12,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927649016] [2024-12-02 10:19:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927649016] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:12,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 10:19:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251657706] [2024-12-02 10:19:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:12,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:19:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:12,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:19:12,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:19:12,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:12,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:12,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:12,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:12,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:14,127 INFO L124 PetriNetUnfolderBase]: 17938/24328 cut-off events. [2024-12-02 10:19:14,127 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-12-02 10:19:14,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46568 conditions, 24328 events. 17938/24328 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 161581 event pairs, 11530 based on Foata normal form. 0/12146 useless extension candidates. Maximal degree in co-relation 46543. Up to 21826 conditions per place. [2024-12-02 10:19:14,250 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 47 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2024-12-02 10:19:14,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 279 flow [2024-12-02 10:19:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:19:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 10:19:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-12-02 10:19:14,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-12-02 10:19:14,253 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 165 flow. Second operand 5 states and 180 transitions. [2024-12-02 10:19:14,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 279 flow [2024-12-02 10:19:14,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:19:14,255 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 199 flow [2024-12-02 10:19:14,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-12-02 10:19:14,256 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2024-12-02 10:19:14,256 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 199 flow [2024-12-02 10:19:14,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:14,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:14,256 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-12-02 10:19:14,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 10:19:14,257 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:14,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:14,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1004735979, now seen corresponding path program 1 times [2024-12-02 10:19:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:14,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280717948] [2024-12-02 10:19:14,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:14,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:14,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280717948] [2024-12-02 10:19:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280717948] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:19:14,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656157840] [2024-12-02 10:19:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:14,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:14,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:19:14,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:19:14,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 10:19:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:14,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 10:19:14,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:19:14,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 10:19:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:14,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:19:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:14,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656157840] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:19:14,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:19:14,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-12-02 10:19:14,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582776965] [2024-12-02 10:19:14,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:19:14,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-12-02 10:19:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:14,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-12-02 10:19:14,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-12-02 10:19:14,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:14,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 199 flow. Second operand has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:14,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:14,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:14,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:17,204 INFO L124 PetriNetUnfolderBase]: 17938/24327 cut-off events. [2024-12-02 10:19:17,205 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-12-02 10:19:17,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46581 conditions, 24327 events. 17938/24327 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 161548 event pairs, 11530 based on Foata normal form. 0/12148 useless extension candidates. Maximal degree in co-relation 46553. Up to 21826 conditions per place. [2024-12-02 10:19:17,380 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 46 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2024-12-02 10:19:17,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 301 flow [2024-12-02 10:19:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:19:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:19:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-12-02 10:19:17,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2024-12-02 10:19:17,383 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 199 flow. Second operand 6 states and 201 transitions. [2024-12-02 10:19:17,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 301 flow [2024-12-02 10:19:17,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 70 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:19:17,386 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 208 flow [2024-12-02 10:19:17,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2024-12-02 10:19:17,386 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2024-12-02 10:19:17,387 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 208 flow [2024-12-02 10:19:17,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:17,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:17,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-12-02 10:19:17,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 10:19:17,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:17,588 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:17,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1004803717, now seen corresponding path program 1 times [2024-12-02 10:19:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:17,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326204358] [2024-12-02 10:19:17,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326204358] [2024-12-02 10:19:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326204358] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:17,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 10:19:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616387501] [2024-12-02 10:19:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:19:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:17,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:19:17,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:19:17,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:17,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:17,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:17,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:17,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:19,512 INFO L124 PetriNetUnfolderBase]: 17939/24330 cut-off events. [2024-12-02 10:19:19,512 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-12-02 10:19:19,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46594 conditions, 24330 events. 17939/24330 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 161477 event pairs, 11530 based on Foata normal form. 0/12150 useless extension candidates. Maximal degree in co-relation 46561. Up to 21828 conditions per place. [2024-12-02 10:19:19,668 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 47 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2024-12-02 10:19:19,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 326 flow [2024-12-02 10:19:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:19:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 10:19:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-12-02 10:19:19,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4649350649350649 [2024-12-02 10:19:19,670 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 208 flow. Second operand 5 states and 179 transitions. [2024-12-02 10:19:19,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 326 flow [2024-12-02 10:19:19,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 73 transitions, 292 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-12-02 10:19:19,673 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 217 flow [2024-12-02 10:19:19,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2024-12-02 10:19:19,674 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2024-12-02 10:19:19,674 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 217 flow [2024-12-02 10:19:19,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:19,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:19,674 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-12-02 10:19:19,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 10:19:19,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:19,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1084109779, now seen corresponding path program 1 times [2024-12-02 10:19:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:19,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566193673] [2024-12-02 10:19:19,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:19,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566193673] [2024-12-02 10:19:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566193673] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:19:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457946068] [2024-12-02 10:19:19,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:19,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:19,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:19:19,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:19:19,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 10:19:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:19,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 10:19:19,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:19:19,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-12-02 10:19:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:20,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:19:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:20,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457946068] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:19:20,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:19:20,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-12-02 10:19:20,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139450109] [2024-12-02 10:19:20,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:19:20,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 10:19:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:20,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 10:19:20,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-12-02 10:19:20,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:20,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 217 flow. Second operand has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:20,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:20,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:20,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:21,973 INFO L124 PetriNetUnfolderBase]: 17939/24329 cut-off events. [2024-12-02 10:19:21,973 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-12-02 10:19:22,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46592 conditions, 24329 events. 17939/24329 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 161535 event pairs, 11530 based on Foata normal form. 0/12152 useless extension candidates. Maximal degree in co-relation 46550. Up to 21821 conditions per place. [2024-12-02 10:19:22,104 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 43 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2024-12-02 10:19:22,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 72 transitions, 323 flow [2024-12-02 10:19:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:19:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 10:19:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2024-12-02 10:19:22,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230055658627087 [2024-12-02 10:19:22,105 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 217 flow. Second operand 7 states and 228 transitions. [2024-12-02 10:19:22,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 72 transitions, 323 flow [2024-12-02 10:19:22,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:19:22,106 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 230 flow [2024-12-02 10:19:22,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2024-12-02 10:19:22,107 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2024-12-02 10:19:22,107 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 230 flow [2024-12-02 10:19:22,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.307692307692307) internal successors, (342), 13 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:22,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:22,107 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-12-02 10:19:22,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 10:19:22,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-12-02 10:19:22,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:22,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash -751235552, now seen corresponding path program 1 times [2024-12-02 10:19:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:22,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091718459] [2024-12-02 10:19:22,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:22,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:22,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:22,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091718459] [2024-12-02 10:19:22,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091718459] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:19:22,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374220545] [2024-12-02 10:19:22,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:22,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:19:22,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:19:22,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 10:19:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:22,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 10:19:22,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:19:22,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-12-02 10:19:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:22,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:19:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374220545] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:19:23,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:19:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-12-02 10:19:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889045885] [2024-12-02 10:19:23,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:19:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-02 10:19:23,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:23,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-02 10:19:23,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-12-02 10:19:23,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:23,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 230 flow. Second operand has 13 states, 13 states have (on average 26.46153846153846) internal successors, (344), 13 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:23,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:23,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:23,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:24,945 INFO L124 PetriNetUnfolderBase]: 17939/24328 cut-off events. [2024-12-02 10:19:24,945 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-12-02 10:19:24,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46597 conditions, 24328 events. 17939/24328 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 161740 event pairs, 11530 based on Foata normal form. 0/12152 useless extension candidates. Maximal degree in co-relation 46552. Up to 21820 conditions per place. [2024-12-02 10:19:25,057 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 39 selfloop transitions, 15 changer transitions 0/71 dead transitions. [2024-12-02 10:19:25,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 334 flow [2024-12-02 10:19:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:19:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 10:19:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2024-12-02 10:19:25,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42115027829313545 [2024-12-02 10:19:25,059 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 230 flow. Second operand 7 states and 227 transitions. [2024-12-02 10:19:25,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 334 flow [2024-12-02 10:19:25,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 309 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-12-02 10:19:25,061 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 231 flow [2024-12-02 10:19:25,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2024-12-02 10:19:25,062 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2024-12-02 10:19:25,062 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 231 flow [2024-12-02 10:19:25,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.46153846153846) internal successors, (344), 13 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:25,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:25,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:25,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-12-02 10:19:25,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-12-02 10:19:25,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:25,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash -260361010, now seen corresponding path program 1 times [2024-12-02 10:19:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:25,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6242780] [2024-12-02 10:19:25,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:25,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:19:25,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:25,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6242780] [2024-12-02 10:19:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6242780] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:25,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:25,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:19:25,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711080443] [2024-12-02 10:19:25,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:25,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:19:25,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:25,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:19:25,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:19:25,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:19:25,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:25,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:25,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:19:25,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:26,981 INFO L124 PetriNetUnfolderBase]: 19386/26067 cut-off events. [2024-12-02 10:19:26,981 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-12-02 10:19:27,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50354 conditions, 26067 events. 19386/26067 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 171980 event pairs, 12584 based on Foata normal form. 412/13375 useless extension candidates. Maximal degree in co-relation 46082. Up to 21829 conditions per place. [2024-12-02 10:19:27,075 INFO L140 encePairwiseOnDemand]: 66/77 looper letters, 89 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-12-02 10:19:27,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 545 flow [2024-12-02 10:19:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:19:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 10:19:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2024-12-02 10:19:27,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2024-12-02 10:19:27,077 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 231 flow. Second operand 4 states and 200 transitions. [2024-12-02 10:19:27,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 545 flow [2024-12-02 10:19:27,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 109 transitions, 488 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-12-02 10:19:27,079 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 219 flow [2024-12-02 10:19:27,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-12-02 10:19:27,080 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2024-12-02 10:19:27,080 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 219 flow [2024-12-02 10:19:27,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:27,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:27,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:27,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 10:19:27,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:27,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1772196457, now seen corresponding path program 1 times [2024-12-02 10:19:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299076641] [2024-12-02 10:19:27,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:19:27,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:27,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299076641] [2024-12-02 10:19:27,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299076641] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:27,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:27,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:19:27,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507896351] [2024-12-02 10:19:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:27,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:19:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:27,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:19:27,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:19:27,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:27,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:27,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:27,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:27,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:31,058 INFO L124 PetriNetUnfolderBase]: 45020/59768 cut-off events. [2024-12-02 10:19:31,058 INFO L125 PetriNetUnfolderBase]: For 2427/3498 co-relation queries the response was YES. [2024-12-02 10:19:31,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129903 conditions, 59768 events. 45020/59768 cut-off events. For 2427/3498 co-relation queries the response was YES. Maximal size of possible extension queue 4127. Compared 415426 event pairs, 18048 based on Foata normal form. 0/31473 useless extension candidates. Maximal degree in co-relation 115182. Up to 22618 conditions per place. [2024-12-02 10:19:31,300 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 136 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2024-12-02 10:19:31,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 157 transitions, 723 flow [2024-12-02 10:19:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:19:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:19:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 288 transitions. [2024-12-02 10:19:31,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2024-12-02 10:19:31,301 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 219 flow. Second operand 6 states and 288 transitions. [2024-12-02 10:19:31,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 157 transitions, 723 flow [2024-12-02 10:19:31,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 157 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:19:31,304 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 248 flow [2024-12-02 10:19:31,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2024-12-02 10:19:31,305 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2024-12-02 10:19:31,305 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 248 flow [2024-12-02 10:19:31,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:31,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:31,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:31,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 10:19:31,305 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:31,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:31,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1918605194, now seen corresponding path program 1 times [2024-12-02 10:19:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066801835] [2024-12-02 10:19:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:31,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:31,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:31,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066801835] [2024-12-02 10:19:31,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066801835] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:31,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:31,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 10:19:31,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230072328] [2024-12-02 10:19:31,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:31,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:19:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:31,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:19:31,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:19:31,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:31,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:31,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:31,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:31,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:34,279 INFO L124 PetriNetUnfolderBase]: 24354/34756 cut-off events. [2024-12-02 10:19:34,279 INFO L125 PetriNetUnfolderBase]: For 4469/4469 co-relation queries the response was YES. [2024-12-02 10:19:34,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75568 conditions, 34756 events. 24354/34756 cut-off events. For 4469/4469 co-relation queries the response was YES. Maximal size of possible extension queue 2614. Compared 267984 event pairs, 18623 based on Foata normal form. 0/20888 useless extension candidates. Maximal degree in co-relation 68199. Up to 31202 conditions per place. [2024-12-02 10:19:34,464 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 50 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-12-02 10:19:34,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 348 flow [2024-12-02 10:19:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:19:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 10:19:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2024-12-02 10:19:34,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4707792207792208 [2024-12-02 10:19:34,465 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 248 flow. Second operand 4 states and 145 transitions. [2024-12-02 10:19:34,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 348 flow [2024-12-02 10:19:34,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 71 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:19:34,484 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 246 flow [2024-12-02 10:19:34,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2024-12-02 10:19:34,484 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2024-12-02 10:19:34,485 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 246 flow [2024-12-02 10:19:34,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:34,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:34,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:34,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 10:19:34,485 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:34,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:34,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1918605193, now seen corresponding path program 1 times [2024-12-02 10:19:34,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:34,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162416874] [2024-12-02 10:19:34,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:34,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:34,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162416874] [2024-12-02 10:19:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162416874] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:34,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:34,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 10:19:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130737967] [2024-12-02 10:19:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:34,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:19:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:34,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:19:34,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:19:34,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:19:34,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:34,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:34,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:19:34,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:37,130 INFO L124 PetriNetUnfolderBase]: 26554/38143 cut-off events. [2024-12-02 10:19:37,130 INFO L125 PetriNetUnfolderBase]: For 5055/5055 co-relation queries the response was YES. [2024-12-02 10:19:37,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83305 conditions, 38143 events. 26554/38143 cut-off events. For 5055/5055 co-relation queries the response was YES. Maximal size of possible extension queue 2600. Compared 297819 event pairs, 20741 based on Foata normal form. 671/23779 useless extension candidates. Maximal degree in co-relation 67365. Up to 31224 conditions per place. [2024-12-02 10:19:37,330 INFO L140 encePairwiseOnDemand]: 65/77 looper letters, 79 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2024-12-02 10:19:37,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 103 transitions, 528 flow [2024-12-02 10:19:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:19:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 10:19:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-12-02 10:19:37,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-12-02 10:19:37,331 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 246 flow. Second operand 5 states and 224 transitions. [2024-12-02 10:19:37,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 103 transitions, 528 flow [2024-12-02 10:19:37,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 103 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:19:37,359 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 291 flow [2024-12-02 10:19:37,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2024-12-02 10:19:37,360 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2024-12-02 10:19:37,360 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 291 flow [2024-12-02 10:19:37,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:37,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:37,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:37,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 10:19:37,361 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:37,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash 419236335, now seen corresponding path program 1 times [2024-12-02 10:19:37,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:37,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361834388] [2024-12-02 10:19:37,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:37,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:19:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361834388] [2024-12-02 10:19:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361834388] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:37,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:19:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513829901] [2024-12-02 10:19:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:37,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:19:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:19:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:19:37,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:37,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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) [2024-12-02 10:19:37,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:37,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:37,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:39,520 INFO L124 PetriNetUnfolderBase]: 18894/27965 cut-off events. [2024-12-02 10:19:39,520 INFO L125 PetriNetUnfolderBase]: For 6499/6499 co-relation queries the response was YES. [2024-12-02 10:19:39,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67915 conditions, 27965 events. 18894/27965 cut-off events. For 6499/6499 co-relation queries the response was YES. Maximal size of possible extension queue 1829. Compared 220296 event pairs, 14603 based on Foata normal form. 0/18554 useless extension candidates. Maximal degree in co-relation 52943. Up to 24725 conditions per place. [2024-12-02 10:19:39,692 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 47 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2024-12-02 10:19:39,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 71 transitions, 389 flow [2024-12-02 10:19:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:19:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 10:19:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-12-02 10:19:39,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-12-02 10:19:39,693 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 291 flow. Second operand 5 states and 168 transitions. [2024-12-02 10:19:39,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 71 transitions, 389 flow [2024-12-02 10:19:39,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 71 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:19:39,716 INFO L231 Difference]: Finished difference. Result has 86 places, 71 transitions, 292 flow [2024-12-02 10:19:39,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=86, PETRI_TRANSITIONS=71} [2024-12-02 10:19:39,717 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2024-12-02 10:19:39,717 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 71 transitions, 292 flow [2024-12-02 10:19:39,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 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) [2024-12-02 10:19:39,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:39,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:39,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 10:19:39,717 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:39,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash 390254940, now seen corresponding path program 1 times [2024-12-02 10:19:39,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:39,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065145692] [2024-12-02 10:19:39,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:39,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065145692] [2024-12-02 10:19:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065145692] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:19:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:19:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563854883] [2024-12-02 10:19:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:39,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:19:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:39,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:19:39,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:19:39,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:39,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 71 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:39,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:39,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:39,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:42,709 INFO L124 PetriNetUnfolderBase]: 28245/39940 cut-off events. [2024-12-02 10:19:42,710 INFO L125 PetriNetUnfolderBase]: For 11160/13832 co-relation queries the response was YES. [2024-12-02 10:19:42,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100123 conditions, 39940 events. 28245/39940 cut-off events. For 11160/13832 co-relation queries the response was YES. Maximal size of possible extension queue 2766. Compared 309230 event pairs, 10804 based on Foata normal form. 0/27033 useless extension candidates. Maximal degree in co-relation 79784. Up to 15414 conditions per place. [2024-12-02 10:19:42,950 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 149 selfloop transitions, 11 changer transitions 0/175 dead transitions. [2024-12-02 10:19:42,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 175 transitions, 937 flow [2024-12-02 10:19:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:19:42,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 10:19:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 349 transitions. [2024-12-02 10:19:42,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5665584415584416 [2024-12-02 10:19:42,952 INFO L175 Difference]: Start difference. First operand has 86 places, 71 transitions, 292 flow. Second operand 8 states and 349 transitions. [2024-12-02 10:19:42,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 175 transitions, 937 flow [2024-12-02 10:19:42,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 175 transitions, 928 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 10:19:42,986 INFO L231 Difference]: Finished difference. Result has 93 places, 75 transitions, 334 flow [2024-12-02 10:19:42,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=334, PETRI_PLACES=93, PETRI_TRANSITIONS=75} [2024-12-02 10:19:42,986 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2024-12-02 10:19:42,987 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 75 transitions, 334 flow [2024-12-02 10:19:42,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:42,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:42,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:42,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 10:19:42,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:42,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 419236336, now seen corresponding path program 1 times [2024-12-02 10:19:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727080449] [2024-12-02 10:19:42,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:43,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727080449] [2024-12-02 10:19:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727080449] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:19:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985124907] [2024-12-02 10:19:43,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:43,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:43,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:19:43,386 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:19:43,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 10:19:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:43,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-12-02 10:19:43,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:19:43,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 10:19:43,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:19:43,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-12-02 10:19:43,578 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 10:19:43,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 10:19:43,598 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-12-02 10:19:43,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-12-02 10:19:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:43,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:19:44,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2024-12-02 10:19:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985124907] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:19:44,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:19:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2024-12-02 10:19:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061381130] [2024-12-02 10:19:44,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:19:44,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-12-02 10:19:44,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:44,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-12-02 10:19:44,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-12-02 10:19:44,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 77 [2024-12-02 10:19:44,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 75 transitions, 334 flow. Second operand has 17 states, 17 states have (on average 23.764705882352942) internal successors, (404), 17 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:44,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:44,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 77 [2024-12-02 10:19:44,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:50,678 INFO L124 PetriNetUnfolderBase]: 30081/45430 cut-off events. [2024-12-02 10:19:50,678 INFO L125 PetriNetUnfolderBase]: For 21540/21540 co-relation queries the response was YES. [2024-12-02 10:19:50,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118901 conditions, 45430 events. 30081/45430 cut-off events. For 21540/21540 co-relation queries the response was YES. Maximal size of possible extension queue 3233. Compared 397372 event pairs, 27831 based on Foata normal form. 0/34093 useless extension candidates. Maximal degree in co-relation 63051. Up to 24647 conditions per place. [2024-12-02 10:19:50,946 INFO L140 encePairwiseOnDemand]: 65/77 looper letters, 101 selfloop transitions, 33 changer transitions 0/153 dead transitions. [2024-12-02 10:19:50,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 153 transitions, 975 flow [2024-12-02 10:19:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 10:19:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-12-02 10:19:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 427 transitions. [2024-12-02 10:19:50,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2024-12-02 10:19:50,947 INFO L175 Difference]: Start difference. First operand has 93 places, 75 transitions, 334 flow. Second operand 14 states and 427 transitions. [2024-12-02 10:19:50,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 153 transitions, 975 flow [2024-12-02 10:19:50,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 153 transitions, 959 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:19:50,995 INFO L231 Difference]: Finished difference. Result has 110 places, 101 transitions, 641 flow [2024-12-02 10:19:50,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=641, PETRI_PLACES=110, PETRI_TRANSITIONS=101} [2024-12-02 10:19:50,996 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 32 predicate places. [2024-12-02 10:19:50,996 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 101 transitions, 641 flow [2024-12-02 10:19:50,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 23.764705882352942) internal successors, (404), 17 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:50,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:50,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:51,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 10:19:51,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:51,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:51,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash 419236338, now seen corresponding path program 1 times [2024-12-02 10:19:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:51,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046575939] [2024-12-02 10:19:51,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:19:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046575939] [2024-12-02 10:19:51,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046575939] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:19:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265934635] [2024-12-02 10:19:51,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:51,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:51,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:19:51,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:19:51,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 10:19:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:51,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 10:19:51,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:19:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:19:51,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:19:51,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-12-02 10:19:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:19:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265934635] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:19:51,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:19:51,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-12-02 10:19:51,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184343448] [2024-12-02 10:19:51,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:19:51,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 10:19:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:51,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 10:19:51,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-12-02 10:19:51,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:19:51,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 101 transitions, 641 flow. Second operand has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 12 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:51,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:51,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:19:51,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:55,548 INFO L124 PetriNetUnfolderBase]: 26932/40781 cut-off events. [2024-12-02 10:19:55,548 INFO L125 PetriNetUnfolderBase]: For 26630/26630 co-relation queries the response was YES. [2024-12-02 10:19:55,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109424 conditions, 40781 events. 26932/40781 cut-off events. For 26630/26630 co-relation queries the response was YES. Maximal size of possible extension queue 2859. Compared 344280 event pairs, 10288 based on Foata normal form. 1060/34910 useless extension candidates. Maximal degree in co-relation 65853. Up to 21515 conditions per place. [2024-12-02 10:19:55,793 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 108 selfloop transitions, 24 changer transitions 0/151 dead transitions. [2024-12-02 10:19:55,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 151 transitions, 1068 flow [2024-12-02 10:19:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:19:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:19:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2024-12-02 10:19:55,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822510822510822 [2024-12-02 10:19:55,795 INFO L175 Difference]: Start difference. First operand has 110 places, 101 transitions, 641 flow. Second operand 6 states and 269 transitions. [2024-12-02 10:19:55,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 151 transitions, 1068 flow [2024-12-02 10:19:55,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 151 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:19:55,854 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 692 flow [2024-12-02 10:19:55,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=115, PETRI_TRANSITIONS=101} [2024-12-02 10:19:55,855 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 37 predicate places. [2024-12-02 10:19:55,855 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 692 flow [2024-12-02 10:19:55,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 12 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:55,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:55,855 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:55,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 10:19:56,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:56,055 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:56,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash 897091383, now seen corresponding path program 2 times [2024-12-02 10:19:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669882981] [2024-12-02 10:19:56,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:19:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:56,075 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:19:56,075 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:19:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:19:56,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:56,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669882981] [2024-12-02 10:19:56,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669882981] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:19:56,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415265329] [2024-12-02 10:19:56,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:19:56,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:56,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:19:56,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:19:56,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 10:19:56,398 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:19:56,398 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:19:56,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-12-02 10:19:56,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:19:56,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 10:19:56,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:19:56,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-12-02 10:19:56,482 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-12-02 10:19:56,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-12-02 10:19:56,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:19:56,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-12-02 10:19:56,508 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 10:19:56,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 10:19:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-02 10:19:56,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:19:56,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415265329] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:19:56,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:19:56,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-12-02 10:19:56,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457482495] [2024-12-02 10:19:56,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:19:56,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:19:56,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:56,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:19:56,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-12-02 10:19:56,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:19:56,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 101 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:56,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:19:56,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:19:56,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:19:59,108 INFO L124 PetriNetUnfolderBase]: 20125/31221 cut-off events. [2024-12-02 10:19:59,108 INFO L125 PetriNetUnfolderBase]: For 26325/26325 co-relation queries the response was YES. [2024-12-02 10:19:59,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83089 conditions, 31221 events. 20125/31221 cut-off events. For 26325/26325 co-relation queries the response was YES. Maximal size of possible extension queue 2102. Compared 269200 event pairs, 18401 based on Foata normal form. 1884/27303 useless extension candidates. Maximal degree in co-relation 43448. Up to 27765 conditions per place. [2024-12-02 10:19:59,318 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 76 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2024-12-02 10:19:59,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 99 transitions, 840 flow [2024-12-02 10:19:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:19:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 10:19:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-12-02 10:19:59,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4577922077922078 [2024-12-02 10:19:59,319 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 692 flow. Second operand 4 states and 141 transitions. [2024-12-02 10:19:59,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 99 transitions, 840 flow [2024-12-02 10:19:59,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 99 transitions, 787 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 10:19:59,392 INFO L231 Difference]: Finished difference. Result has 111 places, 99 transitions, 635 flow [2024-12-02 10:19:59,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=635, PETRI_PLACES=111, PETRI_TRANSITIONS=99} [2024-12-02 10:19:59,392 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2024-12-02 10:19:59,392 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 99 transitions, 635 flow [2024-12-02 10:19:59,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:19:59,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:19:59,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:19:59,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 10:19:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-12-02 10:19:59,593 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:19:59,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:19:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash 473023351, now seen corresponding path program 1 times [2024-12-02 10:19:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:19:59,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489837504] [2024-12-02 10:19:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:19:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:19:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489837504] [2024-12-02 10:19:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489837504] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:19:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578818577] [2024-12-02 10:19:59,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:19:59,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:19:59,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:19:59,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:19:59,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 10:19:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:19:59,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-12-02 10:19:59,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:19:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:59,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:19:59,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-12-02 10:19:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:19:59,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578818577] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:19:59,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:19:59,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-12-02 10:19:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303255083] [2024-12-02 10:19:59,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:19:59,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-12-02 10:19:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:19:59,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-12-02 10:19:59,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-12-02 10:20:00,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:20:00,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 99 transitions, 635 flow. Second operand has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:00,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:00,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:20:00,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:03,605 INFO L124 PetriNetUnfolderBase]: 18476/28510 cut-off events. [2024-12-02 10:20:03,605 INFO L125 PetriNetUnfolderBase]: For 16705/16705 co-relation queries the response was YES. [2024-12-02 10:20:03,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75500 conditions, 28510 events. 18476/28510 cut-off events. For 16705/16705 co-relation queries the response was YES. Maximal size of possible extension queue 1852. Compared 235764 event pairs, 7661 based on Foata normal form. 0/23978 useless extension candidates. Maximal degree in co-relation 39382. Up to 10310 conditions per place. [2024-12-02 10:20:03,852 INFO L140 encePairwiseOnDemand]: 66/77 looper letters, 114 selfloop transitions, 26 changer transitions 0/159 dead transitions. [2024-12-02 10:20:03,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 159 transitions, 1106 flow [2024-12-02 10:20:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:20:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 10:20:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 306 transitions. [2024-12-02 10:20:03,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5677179962894249 [2024-12-02 10:20:03,854 INFO L175 Difference]: Start difference. First operand has 111 places, 99 transitions, 635 flow. Second operand 7 states and 306 transitions. [2024-12-02 10:20:03,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 159 transitions, 1106 flow [2024-12-02 10:20:03,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 159 transitions, 1101 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:20:03,897 INFO L231 Difference]: Finished difference. Result has 117 places, 101 transitions, 704 flow [2024-12-02 10:20:03,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=704, PETRI_PLACES=117, PETRI_TRANSITIONS=101} [2024-12-02 10:20:03,898 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2024-12-02 10:20:03,898 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 101 transitions, 704 flow [2024-12-02 10:20:03,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.333333333333332) internal successors, (364), 12 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:03,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:03,898 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:03,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 10:20:04,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:04,099 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:04,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 473023352, now seen corresponding path program 1 times [2024-12-02 10:20:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462522147] [2024-12-02 10:20:04,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:20:04,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462522147] [2024-12-02 10:20:04,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462522147] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:20:04,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:20:04,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:20:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601532699] [2024-12-02 10:20:04,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:20:04,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:20:04,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:04,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:20:04,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:20:04,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:20:04,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 101 transitions, 704 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:04,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:04,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:20:04,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:06,316 INFO L124 PetriNetUnfolderBase]: 15290/24168 cut-off events. [2024-12-02 10:20:06,316 INFO L125 PetriNetUnfolderBase]: For 22816/22816 co-relation queries the response was YES. [2024-12-02 10:20:06,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67095 conditions, 24168 events. 15290/24168 cut-off events. For 22816/22816 co-relation queries the response was YES. Maximal size of possible extension queue 1554. Compared 205064 event pairs, 13850 based on Foata normal form. 0/21450 useless extension candidates. Maximal degree in co-relation 34869. Up to 21202 conditions per place. [2024-12-02 10:20:06,480 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 66 selfloop transitions, 14 changer transitions 0/99 dead transitions. [2024-12-02 10:20:06,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 99 transitions, 851 flow [2024-12-02 10:20:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:20:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 10:20:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-12-02 10:20:06,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42597402597402595 [2024-12-02 10:20:06,482 INFO L175 Difference]: Start difference. First operand has 117 places, 101 transitions, 704 flow. Second operand 5 states and 164 transitions. [2024-12-02 10:20:06,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 99 transitions, 851 flow [2024-12-02 10:20:06,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 99 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:20:06,517 INFO L231 Difference]: Finished difference. Result has 118 places, 99 transitions, 682 flow [2024-12-02 10:20:06,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=682, PETRI_PLACES=118, PETRI_TRANSITIONS=99} [2024-12-02 10:20:06,517 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 40 predicate places. [2024-12-02 10:20:06,517 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 99 transitions, 682 flow [2024-12-02 10:20:06,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:06,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:06,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:06,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 10:20:06,517 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:06,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 473023353, now seen corresponding path program 1 times [2024-12-02 10:20:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642283066] [2024-12-02 10:20:06,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:20:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:06,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642283066] [2024-12-02 10:20:06,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642283066] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:20:06,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693871219] [2024-12-02 10:20:06,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:06,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:20:06,654 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:20:06,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 10:20:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:06,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 10:20:06,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:20:06,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-12-02 10:20:06,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-12-02 10:20:06,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-12-02 10:20:06,798 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-12-02 10:20:06,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-12-02 10:20:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:20:06,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:20:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693871219] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:20:06,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-12-02 10:20:06,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-12-02 10:20:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234686258] [2024-12-02 10:20:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:20:06,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:20:06,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:06,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:20:06,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:20:06,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:20:06,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 99 transitions, 682 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:06,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:06,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:20:06,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:08,224 INFO L124 PetriNetUnfolderBase]: 10195/16756 cut-off events. [2024-12-02 10:20:08,224 INFO L125 PetriNetUnfolderBase]: For 17954/17954 co-relation queries the response was YES. [2024-12-02 10:20:08,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45143 conditions, 16756 events. 10195/16756 cut-off events. For 17954/17954 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 140644 event pairs, 9101 based on Foata normal form. 938/16169 useless extension candidates. Maximal degree in co-relation 23176. Up to 14353 conditions per place. [2024-12-02 10:20:08,361 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 69 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2024-12-02 10:20:08,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 96 transitions, 819 flow [2024-12-02 10:20:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:20:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 10:20:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-12-02 10:20:08,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44805194805194803 [2024-12-02 10:20:08,362 INFO L175 Difference]: Start difference. First operand has 118 places, 99 transitions, 682 flow. Second operand 4 states and 138 transitions. [2024-12-02 10:20:08,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 96 transitions, 819 flow [2024-12-02 10:20:08,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 96 transitions, 795 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-02 10:20:08,383 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 657 flow [2024-12-02 10:20:08,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=657, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2024-12-02 10:20:08,383 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 35 predicate places. [2024-12-02 10:20:08,383 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 657 flow [2024-12-02 10:20:08,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:08,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:08,383 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:08,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 10:20:08,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:08,584 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:08,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:08,584 INFO L85 PathProgramCache]: Analyzing trace with hash -526203815, now seen corresponding path program 1 times [2024-12-02 10:20:08,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:08,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670140206] [2024-12-02 10:20:08,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:20:08,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:08,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670140206] [2024-12-02 10:20:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670140206] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:20:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655377985] [2024-12-02 10:20:08,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:08,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:08,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:20:08,674 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:20:08,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 10:20:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:08,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 10:20:08,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:20:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:20:08,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:20:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:20:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655377985] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:20:08,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:20:08,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-12-02 10:20:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146398952] [2024-12-02 10:20:08,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:20:08,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 10:20:08,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:08,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 10:20:08,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-12-02 10:20:08,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:20:09,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 657 flow. Second operand has 15 states, 15 states have (on average 29.733333333333334) internal successors, (446), 15 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:09,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:09,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:20:09,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:10,650 INFO L124 PetriNetUnfolderBase]: 10747/17991 cut-off events. [2024-12-02 10:20:10,650 INFO L125 PetriNetUnfolderBase]: For 13546/13546 co-relation queries the response was YES. [2024-12-02 10:20:10,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45790 conditions, 17991 events. 10747/17991 cut-off events. For 13546/13546 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 151680 event pairs, 6446 based on Foata normal form. 688/17214 useless extension candidates. Maximal degree in co-relation 21271. Up to 6686 conditions per place. [2024-12-02 10:20:10,780 INFO L140 encePairwiseOnDemand]: 63/77 looper letters, 158 selfloop transitions, 26 changer transitions 0/203 dead transitions. [2024-12-02 10:20:10,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 203 transitions, 1468 flow [2024-12-02 10:20:10,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 10:20:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 10:20:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 461 transitions. [2024-12-02 10:20:10,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5442739079102715 [2024-12-02 10:20:10,782 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 657 flow. Second operand 11 states and 461 transitions. [2024-12-02 10:20:10,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 203 transitions, 1468 flow [2024-12-02 10:20:10,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 203 transitions, 1455 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:20:10,802 INFO L231 Difference]: Finished difference. Result has 124 places, 99 transitions, 732 flow [2024-12-02 10:20:10,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=732, PETRI_PLACES=124, PETRI_TRANSITIONS=99} [2024-12-02 10:20:10,802 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 46 predicate places. [2024-12-02 10:20:10,802 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 99 transitions, 732 flow [2024-12-02 10:20:10,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 29.733333333333334) internal successors, (446), 15 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:10,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:10,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:10,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 10:20:11,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:11,003 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:11,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1467353824, now seen corresponding path program 1 times [2024-12-02 10:20:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:11,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736771206] [2024-12-02 10:20:11,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:11,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 10:20:11,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736771206] [2024-12-02 10:20:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736771206] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:20:11,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:20:11,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 10:20:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652021418] [2024-12-02 10:20:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:20:11,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:20:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:11,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:20:11,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:20:11,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:20:11,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 99 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:11,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:11,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:20:11,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:12,511 INFO L124 PetriNetUnfolderBase]: 10900/17795 cut-off events. [2024-12-02 10:20:12,511 INFO L125 PetriNetUnfolderBase]: For 21824/21940 co-relation queries the response was YES. [2024-12-02 10:20:12,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48833 conditions, 17795 events. 10900/17795 cut-off events. For 21824/21940 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 140358 event pairs, 4389 based on Foata normal form. 202/16590 useless extension candidates. Maximal degree in co-relation 23345. Up to 8639 conditions per place. [2024-12-02 10:20:12,642 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 100 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-12-02 10:20:12,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 121 transitions, 1034 flow [2024-12-02 10:20:12,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:20:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:20:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2024-12-02 10:20:12,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147186147186147 [2024-12-02 10:20:12,643 INFO L175 Difference]: Start difference. First operand has 124 places, 99 transitions, 732 flow. Second operand 3 states and 142 transitions. [2024-12-02 10:20:12,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 121 transitions, 1034 flow [2024-12-02 10:20:12,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 121 transitions, 999 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-12-02 10:20:12,661 INFO L231 Difference]: Finished difference. Result has 122 places, 100 transitions, 715 flow [2024-12-02 10:20:12,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=122, PETRI_TRANSITIONS=100} [2024-12-02 10:20:12,661 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 44 predicate places. [2024-12-02 10:20:12,661 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 100 transitions, 715 flow [2024-12-02 10:20:12,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:12,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:12,661 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-02 10:20:12,662 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 754992672, now seen corresponding path program 2 times [2024-12-02 10:20:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061529214] [2024-12-02 10:20:12,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:20:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:12,675 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:20:12,675 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:20:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 10:20:12,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:12,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061529214] [2024-12-02 10:20:12,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061529214] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:20:12,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734690081] [2024-12-02 10:20:12,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:20:12,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:12,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:20:12,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:20:12,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 10:20:12,921 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:20:12,921 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:20:12,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-02 10:20:12,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:20:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 10:20:13,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:20:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-02 10:20:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734690081] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:20:13,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:20:13,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-12-02 10:20:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888937059] [2024-12-02 10:20:13,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:20:13,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 10:20:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:13,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 10:20:13,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-12-02 10:20:13,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:20:13,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 100 transitions, 715 flow. Second operand has 16 states, 16 states have (on average 27.0625) internal successors, (433), 16 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:13,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:13,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:20:13,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:17,515 INFO L124 PetriNetUnfolderBase]: 33259/49309 cut-off events. [2024-12-02 10:20:17,515 INFO L125 PetriNetUnfolderBase]: For 58893/60047 co-relation queries the response was YES. [2024-12-02 10:20:17,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146248 conditions, 49309 events. 33259/49309 cut-off events. For 58893/60047 co-relation queries the response was YES. Maximal size of possible extension queue 2399. Compared 388769 event pairs, 14062 based on Foata normal form. 476/46037 useless extension candidates. Maximal degree in co-relation 72715. Up to 16172 conditions per place. [2024-12-02 10:20:17,904 INFO L140 encePairwiseOnDemand]: 63/77 looper letters, 190 selfloop transitions, 49 changer transitions 0/254 dead transitions. [2024-12-02 10:20:17,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 254 transitions, 1831 flow [2024-12-02 10:20:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 10:20:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 10:20:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2024-12-02 10:20:17,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4985014985014985 [2024-12-02 10:20:17,905 INFO L175 Difference]: Start difference. First operand has 122 places, 100 transitions, 715 flow. Second operand 13 states and 499 transitions. [2024-12-02 10:20:17,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 254 transitions, 1831 flow [2024-12-02 10:20:18,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 254 transitions, 1824 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:20:18,001 INFO L231 Difference]: Finished difference. Result has 138 places, 111 transitions, 961 flow [2024-12-02 10:20:18,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=961, PETRI_PLACES=138, PETRI_TRANSITIONS=111} [2024-12-02 10:20:18,002 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 60 predicate places. [2024-12-02 10:20:18,002 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 111 transitions, 961 flow [2024-12-02 10:20:18,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 27.0625) internal successors, (433), 16 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:18,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:18,003 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:18,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 10:20:18,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-12-02 10:20:18,203 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:18,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1617144928, now seen corresponding path program 1 times [2024-12-02 10:20:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404844289] [2024-12-02 10:20:18,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:18,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:20:18,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404844289] [2024-12-02 10:20:18,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404844289] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:20:18,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241962208] [2024-12-02 10:20:18,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:18,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:18,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:20:18,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:20:18,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-02 10:20:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:18,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 10:20:18,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:20:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:20:18,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:20:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:20:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241962208] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:20:18,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:20:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-12-02 10:20:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579610192] [2024-12-02 10:20:18,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:20:18,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-02 10:20:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:18,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-02 10:20:18,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-12-02 10:20:18,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:20:18,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 111 transitions, 961 flow. Second operand has 15 states, 15 states have (on average 29.866666666666667) internal successors, (448), 15 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:18,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:18,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:20:18,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:23,050 INFO L124 PetriNetUnfolderBase]: 30011/49210 cut-off events. [2024-12-02 10:20:23,050 INFO L125 PetriNetUnfolderBase]: For 79667/80371 co-relation queries the response was YES. [2024-12-02 10:20:23,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150702 conditions, 49210 events. 30011/49210 cut-off events. For 79667/80371 co-relation queries the response was YES. Maximal size of possible extension queue 2491. Compared 446831 event pairs, 18348 based on Foata normal form. 1800/47019 useless extension candidates. Maximal degree in co-relation 91296. Up to 22922 conditions per place. [2024-12-02 10:20:23,494 INFO L140 encePairwiseOnDemand]: 65/77 looper letters, 174 selfloop transitions, 66 changer transitions 0/260 dead transitions. [2024-12-02 10:20:23,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 260 transitions, 2498 flow [2024-12-02 10:20:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 10:20:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 10:20:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2024-12-02 10:20:23,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4985014985014985 [2024-12-02 10:20:23,496 INFO L175 Difference]: Start difference. First operand has 138 places, 111 transitions, 961 flow. Second operand 13 states and 499 transitions. [2024-12-02 10:20:23,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 260 transitions, 2498 flow [2024-12-02 10:20:23,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 260 transitions, 2468 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 10:20:23,577 INFO L231 Difference]: Finished difference. Result has 154 places, 143 transitions, 1535 flow [2024-12-02 10:20:23,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1535, PETRI_PLACES=154, PETRI_TRANSITIONS=143} [2024-12-02 10:20:23,577 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 76 predicate places. [2024-12-02 10:20:23,577 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 143 transitions, 1535 flow [2024-12-02 10:20:23,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 29.866666666666667) internal successors, (448), 15 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:23,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:23,578 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:23,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-02 10:20:23,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-12-02 10:20:23,778 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 968334459, now seen corresponding path program 3 times [2024-12-02 10:20:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471186695] [2024-12-02 10:20:23,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 10:20:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:23,796 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 10:20:23,796 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:20:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 10:20:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471186695] [2024-12-02 10:20:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471186695] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:20:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437938197] [2024-12-02 10:20:24,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 10:20:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:24,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:20:24,031 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:20:24,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-02 10:20:24,195 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 10:20:24,195 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:20:24,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-12-02 10:20:24,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:20:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 10:20:24,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:20:24,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2024-12-02 10:20:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-12-02 10:20:24,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437938197] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:20:24,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:20:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2024-12-02 10:20:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171833111] [2024-12-02 10:20:24,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:20:24,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-12-02 10:20:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:24,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-12-02 10:20:24,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-12-02 10:20:25,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:20:25,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 143 transitions, 1535 flow. Second operand has 22 states, 22 states have (on average 27.136363636363637) internal successors, (597), 22 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:25,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:25,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:20:25,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:32,549 INFO L124 PetriNetUnfolderBase]: 49175/69631 cut-off events. [2024-12-02 10:20:32,549 INFO L125 PetriNetUnfolderBase]: For 119697/120237 co-relation queries the response was YES. [2024-12-02 10:20:32,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234420 conditions, 69631 events. 49175/69631 cut-off events. For 119697/120237 co-relation queries the response was YES. Maximal size of possible extension queue 3465. Compared 542311 event pairs, 3543 based on Foata normal form. 394/65756 useless extension candidates. Maximal degree in co-relation 152301. Up to 23517 conditions per place. [2024-12-02 10:20:33,104 INFO L140 encePairwiseOnDemand]: 65/77 looper letters, 189 selfloop transitions, 54 changer transitions 0/258 dead transitions. [2024-12-02 10:20:33,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 258 transitions, 2600 flow [2024-12-02 10:20:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 10:20:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 10:20:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 402 transitions. [2024-12-02 10:20:33,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47461629279811096 [2024-12-02 10:20:33,105 INFO L175 Difference]: Start difference. First operand has 154 places, 143 transitions, 1535 flow. Second operand 11 states and 402 transitions. [2024-12-02 10:20:33,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 258 transitions, 2600 flow [2024-12-02 10:20:33,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 258 transitions, 2545 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-12-02 10:20:33,911 INFO L231 Difference]: Finished difference. Result has 160 places, 143 transitions, 1596 flow [2024-12-02 10:20:33,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1596, PETRI_PLACES=160, PETRI_TRANSITIONS=143} [2024-12-02 10:20:33,911 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 82 predicate places. [2024-12-02 10:20:33,911 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 143 transitions, 1596 flow [2024-12-02 10:20:33,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 27.136363636363637) internal successors, (597), 22 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:33,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:33,912 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:33,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-12-02 10:20:34,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-12-02 10:20:34,112 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:34,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash -632201147, now seen corresponding path program 2 times [2024-12-02 10:20:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522058529] [2024-12-02 10:20:34,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:20:34,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:34,125 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:20:34,125 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:20:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:20:34,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522058529] [2024-12-02 10:20:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522058529] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:20:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281929186] [2024-12-02 10:20:34,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:20:34,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:34,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:20:34,226 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:20:34,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-02 10:20:34,313 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-02 10:20:34,313 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:20:34,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-02 10:20:34,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:20:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:20:34,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:20:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:20:34,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281929186] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:20:34,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:20:34,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-12-02 10:20:34,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398841508] [2024-12-02 10:20:34,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:20:34,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-02 10:20:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:34,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 10:20:34,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-12-02 10:20:34,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:20:34,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 143 transitions, 1596 flow. Second operand has 16 states, 16 states have (on average 27.3125) internal successors, (437), 16 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:34,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:34,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:20:34,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:42,024 INFO L124 PetriNetUnfolderBase]: 43310/65409 cut-off events. [2024-12-02 10:20:42,024 INFO L125 PetriNetUnfolderBase]: For 119249/120853 co-relation queries the response was YES. [2024-12-02 10:20:42,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208263 conditions, 65409 events. 43310/65409 cut-off events. For 119249/120853 co-relation queries the response was YES. Maximal size of possible extension queue 3275. Compared 553678 event pairs, 20036 based on Foata normal form. 916/61885 useless extension candidates. Maximal degree in co-relation 174645. Up to 24767 conditions per place. [2024-12-02 10:20:42,528 INFO L140 encePairwiseOnDemand]: 63/77 looper letters, 183 selfloop transitions, 74 changer transitions 0/274 dead transitions. [2024-12-02 10:20:42,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 274 transitions, 2707 flow [2024-12-02 10:20:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 10:20:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 10:20:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 483 transitions. [2024-12-02 10:20:42,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4825174825174825 [2024-12-02 10:20:42,530 INFO L175 Difference]: Start difference. First operand has 160 places, 143 transitions, 1596 flow. Second operand 13 states and 483 transitions. [2024-12-02 10:20:42,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 274 transitions, 2707 flow [2024-12-02 10:20:42,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 274 transitions, 2533 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-12-02 10:20:42,853 INFO L231 Difference]: Finished difference. Result has 167 places, 148 transitions, 1711 flow [2024-12-02 10:20:42,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1711, PETRI_PLACES=167, PETRI_TRANSITIONS=148} [2024-12-02 10:20:42,854 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 89 predicate places. [2024-12-02 10:20:42,854 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 148 transitions, 1711 flow [2024-12-02 10:20:42,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 27.3125) internal successors, (437), 16 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:42,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:42,854 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:20:42,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-12-02 10:20:43,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-12-02 10:20:43,054 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:43,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:43,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1752018144, now seen corresponding path program 3 times [2024-12-02 10:20:43,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:43,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877701124] [2024-12-02 10:20:43,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 10:20:43,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:43,068 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 10:20:43,068 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:20:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 10:20:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:43,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877701124] [2024-12-02 10:20:43,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877701124] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:20:43,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41601210] [2024-12-02 10:20:43,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 10:20:43,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:20:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:20:43,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:20:43,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-02 10:20:43,425 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-02 10:20:43,425 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:20:43,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-12-02 10:20:43,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:20:43,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-12-02 10:20:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 10:20:43,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:20:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-02 10:20:44,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41601210] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:20:44,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:20:44,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2024-12-02 10:20:44,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902460068] [2024-12-02 10:20:44,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:20:44,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-12-02 10:20:44,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:44,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-12-02 10:20:44,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-12-02 10:20:44,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:20:44,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 148 transitions, 1711 flow. Second operand has 23 states, 23 states have (on average 27.47826086956522) internal successors, (632), 23 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:44,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:44,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:20:44,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:20:54,126 INFO L124 PetriNetUnfolderBase]: 51630/73969 cut-off events. [2024-12-02 10:20:54,126 INFO L125 PetriNetUnfolderBase]: For 128525/128525 co-relation queries the response was YES. [2024-12-02 10:20:54,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248281 conditions, 73969 events. 51630/73969 cut-off events. For 128525/128525 co-relation queries the response was YES. Maximal size of possible extension queue 3391. Compared 567643 event pairs, 3318 based on Foata normal form. 868/70591 useless extension candidates. Maximal degree in co-relation 222939. Up to 17000 conditions per place. [2024-12-02 10:20:54,730 INFO L140 encePairwiseOnDemand]: 64/77 looper letters, 236 selfloop transitions, 65 changer transitions 0/318 dead transitions. [2024-12-02 10:20:54,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 318 transitions, 3136 flow [2024-12-02 10:20:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 10:20:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-12-02 10:20:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 518 transitions. [2024-12-02 10:20:54,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2024-12-02 10:20:54,731 INFO L175 Difference]: Start difference. First operand has 167 places, 148 transitions, 1711 flow. Second operand 14 states and 518 transitions. [2024-12-02 10:20:54,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 318 transitions, 3136 flow [2024-12-02 10:20:55,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 318 transitions, 3043 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-12-02 10:20:55,628 INFO L231 Difference]: Finished difference. Result has 175 places, 161 transitions, 1901 flow [2024-12-02 10:20:55,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1901, PETRI_PLACES=175, PETRI_TRANSITIONS=161} [2024-12-02 10:20:55,629 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 97 predicate places. [2024-12-02 10:20:55,629 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 161 transitions, 1901 flow [2024-12-02 10:20:55,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 27.47826086956522) internal successors, (632), 23 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:55,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:20:55,629 INFO L206 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] [2024-12-02 10:20:55,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-12-02 10:20:55,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-12-02 10:20:55,830 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:20:55,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:20:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash 515204285, now seen corresponding path program 1 times [2024-12-02 10:20:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:20:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497921105] [2024-12-02 10:20:55,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:20:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:20:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:20:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:20:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:20:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497921105] [2024-12-02 10:20:55,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497921105] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:20:55,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:20:55,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:20:55,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654263366] [2024-12-02 10:20:55,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:20:55,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:20:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:20:55,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:20:55,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:20:55,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:20:55,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 161 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:20:55,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:20:55,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:20:55,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:21:01,446 INFO L124 PetriNetUnfolderBase]: 26278/45527 cut-off events. [2024-12-02 10:21:01,446 INFO L125 PetriNetUnfolderBase]: For 109762/110941 co-relation queries the response was YES. [2024-12-02 10:21:01,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153548 conditions, 45527 events. 26278/45527 cut-off events. For 109762/110941 co-relation queries the response was YES. Maximal size of possible extension queue 2481. Compared 439028 event pairs, 10438 based on Foata normal form. 32/43893 useless extension candidates. Maximal degree in co-relation 135275. Up to 20507 conditions per place. [2024-12-02 10:21:02,025 INFO L140 encePairwiseOnDemand]: 75/77 looper letters, 153 selfloop transitions, 4 changer transitions 0/184 dead transitions. [2024-12-02 10:21:02,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 184 transitions, 2341 flow [2024-12-02 10:21:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:21:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:21:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-12-02 10:21:02,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5887445887445888 [2024-12-02 10:21:02,026 INFO L175 Difference]: Start difference. First operand has 175 places, 161 transitions, 1901 flow. Second operand 3 states and 136 transitions. [2024-12-02 10:21:02,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 184 transitions, 2341 flow [2024-12-02 10:21:02,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 184 transitions, 2215 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-12-02 10:21:02,553 INFO L231 Difference]: Finished difference. Result has 170 places, 160 transitions, 1777 flow [2024-12-02 10:21:02,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1777, PETRI_PLACES=170, PETRI_TRANSITIONS=160} [2024-12-02 10:21:02,553 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 92 predicate places. [2024-12-02 10:21:02,553 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 160 transitions, 1777 flow [2024-12-02 10:21:02,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:02,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:21:02,553 INFO L206 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] [2024-12-02 10:21:02,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-02 10:21:02,553 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:21:02,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:21:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash -695489632, now seen corresponding path program 1 times [2024-12-02 10:21:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:21:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494853368] [2024-12-02 10:21:02,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:21:02,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:21:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:21:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 10:21:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:21:02,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494853368] [2024-12-02 10:21:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494853368] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:21:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:21:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:21:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485310664] [2024-12-02 10:21:02,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:21:02,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:21:02,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:21:02,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:21:02,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:21:02,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:21:02,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 160 transitions, 1777 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:02,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:21:02,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:21:02,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:21:09,935 INFO L124 PetriNetUnfolderBase]: 32897/57948 cut-off events. [2024-12-02 10:21:09,935 INFO L125 PetriNetUnfolderBase]: For 134159/135204 co-relation queries the response was YES. [2024-12-02 10:21:10,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182984 conditions, 57948 events. 32897/57948 cut-off events. For 134159/135204 co-relation queries the response was YES. Maximal size of possible extension queue 2999. Compared 576968 event pairs, 12736 based on Foata normal form. 76/56591 useless extension candidates. Maximal degree in co-relation 159782. Up to 26158 conditions per place. [2024-12-02 10:21:10,609 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 163 selfloop transitions, 4 changer transitions 6/200 dead transitions. [2024-12-02 10:21:10,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 200 transitions, 2433 flow [2024-12-02 10:21:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:21:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:21:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-12-02 10:21:10,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5844155844155844 [2024-12-02 10:21:10,610 INFO L175 Difference]: Start difference. First operand has 170 places, 160 transitions, 1777 flow. Second operand 3 states and 135 transitions. [2024-12-02 10:21:10,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 200 transitions, 2433 flow [2024-12-02 10:21:11,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 200 transitions, 2425 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:21:11,073 INFO L231 Difference]: Finished difference. Result has 172 places, 158 transitions, 1732 flow [2024-12-02 10:21:11,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1732, PETRI_PLACES=172, PETRI_TRANSITIONS=158} [2024-12-02 10:21:11,073 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 94 predicate places. [2024-12-02 10:21:11,073 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 1732 flow [2024-12-02 10:21:11,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:11,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:21:11,074 INFO L206 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] [2024-12-02 10:21:11,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-02 10:21:11,074 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:21:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:21:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1366819297, now seen corresponding path program 1 times [2024-12-02 10:21:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:21:11,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361540106] [2024-12-02 10:21:11,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:21:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:21:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:21:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-02 10:21:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:21:11,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361540106] [2024-12-02 10:21:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361540106] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:21:11,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:21:11,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 10:21:11,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82036867] [2024-12-02 10:21:11,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:21:11,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:21:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:21:11,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:21:11,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:21:11,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 77 [2024-12-02 10:21:11,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 158 transitions, 1732 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:11,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:21:11,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 77 [2024-12-02 10:21:11,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:21:16,165 INFO L124 PetriNetUnfolderBase]: 25684/44765 cut-off events. [2024-12-02 10:21:16,165 INFO L125 PetriNetUnfolderBase]: For 121071/122075 co-relation queries the response was YES. [2024-12-02 10:21:16,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150381 conditions, 44765 events. 25684/44765 cut-off events. For 121071/122075 co-relation queries the response was YES. Maximal size of possible extension queue 2258. Compared 430944 event pairs, 11109 based on Foata normal form. 1288/44777 useless extension candidates. Maximal degree in co-relation 129206. Up to 21711 conditions per place. [2024-12-02 10:21:16,542 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 150 selfloop transitions, 3 changer transitions 10/188 dead transitions. [2024-12-02 10:21:16,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 188 transitions, 2221 flow [2024-12-02 10:21:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:21:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:21:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-12-02 10:21:16,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6017316017316018 [2024-12-02 10:21:16,543 INFO L175 Difference]: Start difference. First operand has 172 places, 158 transitions, 1732 flow. Second operand 3 states and 139 transitions. [2024-12-02 10:21:16,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 188 transitions, 2221 flow [2024-12-02 10:21:17,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 188 transitions, 2205 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-12-02 10:21:17,015 INFO L231 Difference]: Finished difference. Result has 173 places, 148 transitions, 1562 flow [2024-12-02 10:21:17,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1562, PETRI_PLACES=173, PETRI_TRANSITIONS=148} [2024-12-02 10:21:17,016 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 95 predicate places. [2024-12-02 10:21:17,016 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 148 transitions, 1562 flow [2024-12-02 10:21:17,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:17,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:21:17,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:21:17,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-02 10:21:17,016 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:21:17,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:21:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1840191879, now seen corresponding path program 1 times [2024-12-02 10:21:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:21:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773240698] [2024-12-02 10:21:17,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:21:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:21:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:21:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-02 10:21:17,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:21:17,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773240698] [2024-12-02 10:21:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773240698] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:21:17,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:21:17,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:21:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734046078] [2024-12-02 10:21:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:21:17,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:21:17,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:21:17,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:21:17,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:21:17,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 77 [2024-12-02 10:21:17,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 148 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:17,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:21:17,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 77 [2024-12-02 10:21:17,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:21:23,300 INFO L124 PetriNetUnfolderBase]: 29940/48961 cut-off events. [2024-12-02 10:21:23,300 INFO L125 PetriNetUnfolderBase]: For 137640/138168 co-relation queries the response was YES. [2024-12-02 10:21:23,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173689 conditions, 48961 events. 29940/48961 cut-off events. For 137640/138168 co-relation queries the response was YES. Maximal size of possible extension queue 2447. Compared 433864 event pairs, 4422 based on Foata normal form. 1398/49879 useless extension candidates. Maximal degree in co-relation 150042. Up to 33987 conditions per place. [2024-12-02 10:21:23,884 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 144 selfloop transitions, 24 changer transitions 5/195 dead transitions. [2024-12-02 10:21:23,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 195 transitions, 2207 flow [2024-12-02 10:21:23,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:21:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:21:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2024-12-02 10:21:23,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-12-02 10:21:23,885 INFO L175 Difference]: Start difference. First operand has 173 places, 148 transitions, 1562 flow. Second operand 6 states and 220 transitions. [2024-12-02 10:21:23,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 195 transitions, 2207 flow [2024-12-02 10:21:25,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 195 transitions, 2136 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-12-02 10:21:25,520 INFO L231 Difference]: Finished difference. Result has 161 places, 142 transitions, 1480 flow [2024-12-02 10:21:25,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1480, PETRI_PLACES=161, PETRI_TRANSITIONS=142} [2024-12-02 10:21:25,521 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 83 predicate places. [2024-12-02 10:21:25,521 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 142 transitions, 1480 flow [2024-12-02 10:21:25,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:25,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:21:25,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:21:25,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-02 10:21:25,521 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:21:25,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:21:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1228195675, now seen corresponding path program 1 times [2024-12-02 10:21:25,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:21:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885311286] [2024-12-02 10:21:25,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:21:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:21:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:21:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 10:21:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:21:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885311286] [2024-12-02 10:21:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885311286] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:21:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108679859] [2024-12-02 10:21:25,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:21:25,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:21:25,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:21:25,668 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:21:25,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-12-02 10:21:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:21:25,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 10:21:25,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:21:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 10:21:25,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:21:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:21:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108679859] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 10:21:25,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 10:21:25,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 5] total 15 [2024-12-02 10:21:25,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721307641] [2024-12-02 10:21:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:21:25,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 10:21:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:21:25,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:21:25,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-12-02 10:21:25,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 77 [2024-12-02 10:21:25,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 142 transitions, 1480 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:25,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:21:25,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 77 [2024-12-02 10:21:25,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:21:34,851 INFO L124 PetriNetUnfolderBase]: 53491/77226 cut-off events. [2024-12-02 10:21:34,851 INFO L125 PetriNetUnfolderBase]: For 190906/192938 co-relation queries the response was YES. [2024-12-02 10:21:35,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268131 conditions, 77226 events. 53491/77226 cut-off events. For 190906/192938 co-relation queries the response was YES. Maximal size of possible extension queue 3128. Compared 597088 event pairs, 3125 based on Foata normal form. 4070/76690 useless extension candidates. Maximal degree in co-relation 196597. Up to 16211 conditions per place. [2024-12-02 10:21:35,487 INFO L140 encePairwiseOnDemand]: 67/77 looper letters, 246 selfloop transitions, 56 changer transitions 14/329 dead transitions. [2024-12-02 10:21:35,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 329 transitions, 3052 flow [2024-12-02 10:21:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-02 10:21:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-12-02 10:21:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 523 transitions. [2024-12-02 10:21:35,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45281385281385284 [2024-12-02 10:21:35,489 INFO L175 Difference]: Start difference. First operand has 161 places, 142 transitions, 1480 flow. Second operand 15 states and 523 transitions. [2024-12-02 10:21:35,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 329 transitions, 3052 flow [2024-12-02 10:21:37,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 329 transitions, 2941 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-12-02 10:21:37,647 INFO L231 Difference]: Finished difference. Result has 171 places, 160 transitions, 1614 flow [2024-12-02 10:21:37,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1614, PETRI_PLACES=171, PETRI_TRANSITIONS=160} [2024-12-02 10:21:37,648 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2024-12-02 10:21:37,648 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 160 transitions, 1614 flow [2024-12-02 10:21:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:37,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:21:37,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:21:37,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-12-02 10:21:37,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-12-02 10:21:37,848 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:21:37,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:21:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2106900943, now seen corresponding path program 1 times [2024-12-02 10:21:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:21:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336561863] [2024-12-02 10:21:37,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:21:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:21:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:21:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:21:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:21:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336561863] [2024-12-02 10:21:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336561863] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:21:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573583766] [2024-12-02 10:21:38,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:21:38,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:21:38,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:21:38,008 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:21:38,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-12-02 10:21:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:21:38,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 10:21:38,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:21:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:21:38,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:21:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:21:38,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573583766] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 10:21:38,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 10:21:38,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6] total 17 [2024-12-02 10:21:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026034918] [2024-12-02 10:21:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:21:38,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 10:21:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:21:38,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:21:38,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-12-02 10:21:38,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 77 [2024-12-02 10:21:38,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 160 transitions, 1614 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:21:38,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:21:38,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 77 [2024-12-02 10:21:38,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:21:53,432 INFO L124 PetriNetUnfolderBase]: 88074/129178 cut-off events. [2024-12-02 10:21:53,432 INFO L125 PetriNetUnfolderBase]: For 420977/424075 co-relation queries the response was YES. [2024-12-02 10:21:54,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482715 conditions, 129178 events. 88074/129178 cut-off events. For 420977/424075 co-relation queries the response was YES. Maximal size of possible extension queue 4820. Compared 1053941 event pairs, 15480 based on Foata normal form. 2724/123442 useless extension candidates. Maximal degree in co-relation 457887. Up to 41457 conditions per place. [2024-12-02 10:21:54,516 INFO L140 encePairwiseOnDemand]: 65/77 looper letters, 242 selfloop transitions, 63 changer transitions 1/337 dead transitions. [2024-12-02 10:21:54,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 337 transitions, 3656 flow [2024-12-02 10:21:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 10:21:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-12-02 10:21:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 324 transitions. [2024-12-02 10:21:54,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675324675324675 [2024-12-02 10:21:54,518 INFO L175 Difference]: Start difference. First operand has 171 places, 160 transitions, 1614 flow. Second operand 9 states and 324 transitions. [2024-12-02 10:21:54,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 337 transitions, 3656 flow [2024-12-02 10:22:15,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 337 transitions, 3572 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-12-02 10:22:15,236 INFO L231 Difference]: Finished difference. Result has 175 places, 204 transitions, 2195 flow [2024-12-02 10:22:15,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2195, PETRI_PLACES=175, PETRI_TRANSITIONS=204} [2024-12-02 10:22:15,236 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 97 predicate places. [2024-12-02 10:22:15,236 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 204 transitions, 2195 flow [2024-12-02 10:22:15,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:22:15,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:22:15,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:22:15,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-12-02 10:22:15,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-12-02 10:22:15,437 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:22:15,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:22:15,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2024401101, now seen corresponding path program 2 times [2024-12-02 10:22:15,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:22:15,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222738655] [2024-12-02 10:22:15,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:22:15,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:22:15,452 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:22:15,452 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:22:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-02 10:22:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:22:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222738655] [2024-12-02 10:22:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222738655] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:22:15,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:22:15,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:22:15,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140659337] [2024-12-02 10:22:15,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:22:15,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:22:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:22:15,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:22:15,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:22:15,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 77 [2024-12-02 10:22:15,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 204 transitions, 2195 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:22:15,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:22:15,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 77 [2024-12-02 10:22:15,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:22:33,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 21#L80true, 58#L104true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:33,497 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-12-02 10:22:33,497 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-12-02 10:22:33,497 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-12-02 10:22:33,497 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-12-02 10:22:35,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 21#L80true, 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:35,768 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-12-02 10:22:35,768 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:35,768 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:35,768 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:35,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 4#L119true, 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:35,801 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-12-02 10:22:35,801 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:35,801 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:35,801 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:35,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 58#L104true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:35,802 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-12-02 10:22:35,802 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:35,802 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:35,802 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-12-02 10:22:38,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:38,094 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-12-02 10:22:38,094 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,094 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,094 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:38,094 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-12-02 10:22:38,094 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,094 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,094 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 273#(<= ~n1~0 0), 21#L80true, 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:38,095 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-12-02 10:22:38,095 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,095 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,095 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 21#L80true, 58#L104true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 64#L114true, Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:38,287 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-12-02 10:22:38,287 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,287 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:38,287 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:39,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 21#L80true, 58#L104true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:39,563 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-12-02 10:22:39,563 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:39,563 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:39,563 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-12-02 10:22:39,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:39,833 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:39,833 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,833 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,833 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 273#(<= ~n1~0 0), 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:39,833 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:39,833 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,833 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,834 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 4#L119true, 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:39,837 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:39,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,837 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 58#L104true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:39,838 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:39,838 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,838 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,838 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 21#L80true, 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:39,938 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:39,938 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,938 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,938 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 4#L119true, 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:39,989 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:39,989 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,989 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,989 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 58#L104true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), 64#L114true, Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:39,989 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:39,989 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,989 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:39,989 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 21#L80true, 58#L104true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:41,539 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:41,539 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,539 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,539 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:41,793 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:41,793 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,793 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,793 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 58#L104true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:41,793 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-12-02 10:22:41,793 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,793 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,793 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-12-02 10:22:41,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), Black: 1293#(<= 0 ~j~0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:41,959 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:41,959 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:41,959 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:41,959 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:41,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 58#L104true, Black: 1293#(<= 0 ~j~0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:41,960 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:41,960 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:41,960 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:41,960 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:42,029 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:42,029 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,029 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,029 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:42,030 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:42,030 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,030 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,030 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 273#(<= ~n1~0 0), 21#L80true, 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 69#L149-1true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:42,031 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:42,031 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,031 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,031 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 21#L80true, 318#true, 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 64#L114true, Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:42,524 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:42,524 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,524 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:42,524 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:43,275 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:43,275 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,276 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,276 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 58#L104true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:43,276 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:43,276 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,276 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,276 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 273#(<= ~n1~0 0), 21#L80true, 58#L104true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 69#L149-1true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:43,277 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-12-02 10:22:43,277 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,277 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,277 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-12-02 10:22:43,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), Black: 1293#(<= 0 ~j~0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:43,406 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:43,406 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,406 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,406 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), Black: 273#(<= ~n1~0 0), 58#L104true, Black: 1293#(<= 0 ~j~0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:43,406 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:43,406 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,406 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,406 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 69#L149-1true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:43,463 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:43,463 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,463 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,463 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 273#(<= ~n1~0 0), 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 69#L149-1true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:43,463 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:43,463 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,463 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,463 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,805 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 21#L80true, 318#true, 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:43,805 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:43,805 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,805 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,805 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:43,899 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:43,899 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,899 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,899 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 58#L104true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:43,900 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:43,900 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,900 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:43,900 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 69#L149-1true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:44,588 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:44,588 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,588 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,588 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 273#(<= ~n1~0 0), 58#L104true, 318#true, Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 305#true, 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 69#L149-1true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:44,588 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:44,589 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,589 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,589 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 47#thread1EXITtrue, 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 67#L148-4true, 318#true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 4#L119true, 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:44,608 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:44,608 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,608 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,608 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 67#L148-4true, 58#L104true, 318#true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:44,608 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-12-02 10:22:44,608 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,608 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,608 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-12-02 10:22:44,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), Black: 1293#(<= 0 ~j~0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 36#L150true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:44,643 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 10:22:44,643 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,643 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,643 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), Black: 273#(<= ~n1~0 0), 58#L104true, Black: 1293#(<= 0 ~j~0), 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 293#(<= ~n2~0 0), Black: 318#true, Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 350#(and (= ~q1~0.offset 0) (<= ~n1~0 1) (or (and (exists ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int)) (<= 4 (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))) (< 3 (select |#length| ~q1~0.base)))), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 36#L150true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:44,643 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 10:22:44,644 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,644 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,644 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 318#true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 10#L101true, Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 27#L149true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:44,972 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 10:22:44,972 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,972 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,972 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 318#true, 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:44,972 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 10:22:44,972 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,972 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,972 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 273#(<= ~n1~0 0), 21#L80true, 58#L104true, 318#true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, 69#L149-1true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 854#(= ~q2_back~0 ~q2_front~0), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:44,973 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 10:22:44,973 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,973 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:44,973 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:45,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 318#true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:45,807 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 10:22:45,807 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:45,807 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:45,808 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:45,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 47#thread1EXITtrue, Black: 273#(<= ~n1~0 0), 58#L104true, 318#true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 27#L149true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:45,808 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-12-02 10:22:45,808 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:45,808 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:45,808 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-12-02 10:22:46,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 318#true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:46,201 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-12-02 10:22:46,201 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,201 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,201 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [999#true, 1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 1515#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 273#(<= ~n1~0 0), 318#true, 58#L104true, 289#(= (select |#valid| ~f~0.base) 1), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), 26#L83true, Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), 305#true, Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), 1293#(<= 0 ~j~0), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1920#true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), Black: 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1636#true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0))]) [2024-12-02 10:22:46,201 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-12-02 10:22:46,201 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,201 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,201 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 318#true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:46,802 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-12-02 10:22:46,802 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,802 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,802 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), Black: 273#(<= ~n1~0 0), 58#L104true, 318#true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 69#L149-1true, Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), 7#thread2EXITtrue, Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:46,802 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-12-02 10:22:46,802 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,802 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:46,802 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-12-02 10:22:47,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1089] L114-->L119: Formula: (let ((.cse1 (* v_~q2_front~0_128 4))) (let ((.cse0 (+ v_~q2~0.offset_107 .cse1))) (and (= v_~total~0_107 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= (select |v_#valid_246| v_~q2~0.base_111) 1) (not (= (ite (and (<= 0 v_~q2_front~0_128) (< v_~q2_front~0_128 v_~q2_back~0_114) (< v_~q2_front~0_128 v_~n2~0_86)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (<= v_~total~0_108 |v_thread4Thread1of1ForFork0_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| v_~total~0_108) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647)) 1 0) 0)) (= |v_thread4Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_108 (select (select |v_#memory_int#1_84| v_~q2~0.base_111) .cse0))) (<= v_~total~0_107 2147483647) (<= (+ v_~q2~0.offset_107 .cse1 4) (select |v_#length_235| v_~q2~0.base_111)) (<= 0 .cse0) (<= 0 (+ v_~total~0_107 2147483648)) (= (+ v_~q2_front~0_128 1) v_~q2_front~0_127)))) InVars {~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, #valid=|v_#valid_246|, ~q2_front~0=v_~q2_front~0_128, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, #memory_int#1=|v_#memory_int#1_84|, ~q2_back~0=v_~q2_back~0_114, ~total~0=v_~total~0_108} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, ~n2~0=v_~n2~0_86, ~q2~0.offset=v_~q2~0.offset_107, thread4Thread1of1ForFork0_#t~post15#1=|v_thread4Thread1of1ForFork0_#t~post15#1_1|, ~q2_front~0=v_~q2_front~0_127, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, #memory_int#1=|v_#memory_int#1_84|, ~total~0=v_~total~0_107, thread4Thread1of1ForFork0_#t~mem13#1=|v_thread4Thread1of1ForFork0_#t~mem13#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_#t~ret14#1=|v_thread4Thread1of1ForFork0_#t~ret14#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #valid=|v_#valid_246|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, ~q2~0.base=v_~q2~0.base_111, #length=|v_#length_235|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_114} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_#t~mem13#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_#t~ret14#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_#t~post15#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~total~0][398], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), 2233#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 273#(<= ~n1~0 0), 318#true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), 10#L101true, Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 1920#true, 4#L119true, Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 36#L150true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:47,348 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-12-02 10:22:47,348 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 10:22:47,348 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 10:22:47,348 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 10:22:47,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1082] L101-->L104: Formula: (= (ite (= (ite (or (< v_~q1_front~0_7 v_~q1_back~0_9) (< v_~i~0_8 v_~N~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork2_~cond~2#1_7|) InVars {~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} OutVars{thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_7|, ~N~0=v_~N~0_6, ~q1_front~0=v_~q1_front~0_7, ~i~0=v_~i~0_8, ~q1_back~0=v_~q1_back~0_9} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~cond~2#1][399], [1620#(= (select |#valid| ~q2~0.base) 1), 164#(<= ~n2~0 2147483647), Black: 273#(<= ~n1~0 0), 58#L104true, 318#true, Black: 1293#(<= 0 ~j~0), Black: 1331#(and (<= 0 ~j~0) (<= ~N~0 1)), 289#(= (select |#valid| ~f~0.base) 1), Black: 1353#(and (<= 1 ~j~0) (<= ~N~0 1)), Black: 1440#(and (<= 1 ~j~0) (<= ~N~0 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 293#(<= ~n2~0 0), Black: 321#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= (+ (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 1073741824) 4294967296)) (* |ULTIMATE.start_create_fresh_int_array_~size#1| 4)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) (select |#length| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2217#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), Black: 2145#(= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0), Black: 2219#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), Black: 2221#(and (<= (+ ~j~0 1) ~N~0) (or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)) (<= ~j~0 0)), Black: 2149#(or (< 0 (mod |thread4Thread1of1ForFork0_~cond~3#1| 256)) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0)), 681#(and (or (= ~f~0.base ~q2~0.base) (= (select |#valid| ~q2~0.base) 1)) (or (= (select |#valid| ~q2~0.base) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~q2~0.base))), 544#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base)) (= (select |#valid| ~q1~0.base) 1)), 301#(= (select |#valid| ~q1~0.base) 1), 1057#(and (= ~n2~0 1) (<= 1 ~q2_back~0)), 2230#(or (and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)))), 1288#(and (<= 1 ~i~0) (<= (+ (* ~N~0 4) ~f~0.offset) (select |#length| ~f~0.base)) (<= 0 ~f~0.offset) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (and (<= (+ (* ~i~0 4) 4 ~f~0.offset) (select |#length| ~f~0.base)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)))), Black: 1603#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (or (< 3 (select |#length| ~f~0.base)) (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 736#(<= ~n1~0 1), Black: 1493#(and (= ~j~0 0) (= (mod (select |#length| ~f~0.base) 4) 0) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~q1_back~0) (= ~n1~0 1)), Black: 780#(and (<= 0 ~q1_back~0) (<= ~n1~0 1) (<= (+ ~q1_back~0 1) ~n1~0)), Black: 854#(= ~q2_back~0 ~q2_front~0), Black: 1623#(= ~total~0 0), Black: 1627#(= ~q1_back~0 ~q1_front~0), Black: 993#(and (<= 1 ~i~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 1)), Black: 896#(and (<= 0 ~i~0) (<= ~N~0 1)), Black: 1634#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 985#(and (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 858#(<= 0 ~i~0), 1920#true, Black: 912#(and (<= 1 ~i~0) (<= ~N~0 1)), 1607#(and (= (mod (select |#length| ~f~0.base) 4) 0) (= ~j~0 1) (or (and (<= 2 (div (select |#length| ~f~0.base) 4)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (<= (div (select |#length| ~f~0.base) 4) 1073741823) (<= 0 (div (select |#length| ~f~0.base) 4)) (<= ~N~0 (div (select |#length| ~f~0.base) 4)) (= ~f~0.offset 0)), 36#L150true, Black: 1003#(<= ~n2~0 1), 991#(and (<= 0 ~i~0) (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256))), Black: 999#true, Black: 1053#(and (<= ~n2~0 1) (<= (+ ~q2_back~0 1) ~n2~0) (<= 0 ~q2_back~0)), 310#(< (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 1), Black: 1019#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1636#true, Black: 1903#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0)), 704#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 1853#(< 0 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)), Black: 1907#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), 64#L114true, Black: 1909#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (<= ~j~0 0) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1911#(and (<= 1 (mod |thread2Thread1of1ForFork1_~cond~1#1| 256)) (or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1)))), Black: 1798#(or (< ~q1_front~0 0) (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 1901#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 0)), 1438#(and (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (<= 0 ~j~0))]) [2024-12-02 10:22:47,348 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-12-02 10:22:47,348 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 10:22:47,348 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 10:22:47,348 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-12-02 10:22:48,516 INFO L124 PetriNetUnfolderBase]: 157376/232727 cut-off events. [2024-12-02 10:22:48,516 INFO L125 PetriNetUnfolderBase]: For 1007694/1033960 co-relation queries the response was YES. [2024-12-02 10:22:50,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010977 conditions, 232727 events. 157376/232727 cut-off events. For 1007694/1033960 co-relation queries the response was YES. Maximal size of possible extension queue 9281. Compared 2058058 event pairs, 32121 based on Foata normal form. 16348/243795 useless extension candidates. Maximal degree in co-relation 919784. Up to 76555 conditions per place. [2024-12-02 10:22:51,126 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 358 selfloop transitions, 72 changer transitions 0/468 dead transitions. [2024-12-02 10:22:51,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 468 transitions, 6079 flow [2024-12-02 10:22:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:22:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:22:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 251 transitions. [2024-12-02 10:22:51,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432900432900433 [2024-12-02 10:22:51,128 INFO L175 Difference]: Start difference. First operand has 175 places, 204 transitions, 2195 flow. Second operand 6 states and 251 transitions. [2024-12-02 10:22:51,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 468 transitions, 6079 flow [2024-12-02 10:25:02,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 468 transitions, 6026 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-12-02 10:25:02,809 INFO L231 Difference]: Finished difference. Result has 182 places, 271 transitions, 3168 flow [2024-12-02 10:25:02,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3168, PETRI_PLACES=182, PETRI_TRANSITIONS=271} [2024-12-02 10:25:02,809 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 104 predicate places. [2024-12-02 10:25:02,809 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 271 transitions, 3168 flow [2024-12-02 10:25:02,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:25:02,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:25:02,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:25:02,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-02 10:25:02,810 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-12-02 10:25:02,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:25:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1748542405, now seen corresponding path program 1 times [2024-12-02 10:25:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:25:02,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765292994] [2024-12-02 10:25:02,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:25:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:25:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:25:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-02 10:25:02,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:25:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765292994] [2024-12-02 10:25:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765292994] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:25:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085717515] [2024-12-02 10:25:02,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:25:02,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:25:02,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:25:02,988 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:25:02,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c24a01ad-6c83-4f40-abe6-c091ff841f12/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-12-02 10:25:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:25:03,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-02 10:25:03,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:25:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 10:25:03,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:25:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 10:25:03,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085717515] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-02 10:25:03,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-02 10:25:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 20 [2024-12-02 10:25:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954248250] [2024-12-02 10:25:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:25:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 10:25:03,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:25:03,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:25:03,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-12-02 10:25:03,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 77 [2024-12-02 10:25:03,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 271 transitions, 3168 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:25:03,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:25:03,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 77 [2024-12-02 10:25:03,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand