./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:50:59,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:50:59,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:50:59,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:50:59,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:50:59,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:50:59,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:50:59,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:50:59,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:50:59,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:50:59,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:50:59,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:50:59,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:50:59,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:50:59,648 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:50:59,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:50:59,650 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:50:59,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:50:59,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:50:59,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:50:59,650 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:50:59,651 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:50:59,651 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:50:59,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:50:59,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:50:59,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:50:59,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:50:59,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:50:59,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:50:59,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:50:59,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:50:59,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:50:59,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:50:59,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:50:59,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:50:59,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:50:59,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:50:59,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:50:59,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:50:59,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:50:59,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:50:59,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:50:59,656 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2024-11-19 09:50:59,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:50:59,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:50:59,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:50:59,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:50:59,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:50:59,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2024-11-19 09:51:01,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:51:01,289 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:51:01,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2024-11-19 09:51:01,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5339661/af90e6c065a44ce3ab6dac8162564fe1/FLAG771bf4123 [2024-11-19 09:51:01,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5339661/af90e6c065a44ce3ab6dac8162564fe1 [2024-11-19 09:51:01,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:51:01,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:51:01,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:51:01,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:51:01,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:51:01,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:01,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7513c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01, skipping insertion in model container [2024-11-19 09:51:01,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:01,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:51:01,903 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:51:01,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:51:01,914 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:51:01,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:51:01,956 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:51:01,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01 WrapperNode [2024-11-19 09:51:01,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:51:01,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:51:01,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:51:01,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:51:01,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:01,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,014 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 294 [2024-11-19 09:51:02,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:51:02,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:51:02,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:51:02,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:51:02,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,042 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-19 09:51:02,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:51:02,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:51:02,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:51:02,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:51:02,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (1/1) ... [2024-11-19 09:51:02,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:51:02,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:51:02,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:51:02,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:51:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:51:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:51:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:51:02,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:51:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:51:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:51:02,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:51:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:51:02,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:51:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:51:02,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:51:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 09:51:02,129 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 09:51:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:51:02,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:51:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:51:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:51:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:51:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:51:02,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:51:02,131 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:51:02,222 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:51:02,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:51:02,578 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:51:02,578 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:51:02,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:51:02,832 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 09:51:02,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:51:02 BoogieIcfgContainer [2024-11-19 09:51:02,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:51:02,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:51:02,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:51:02,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:51:02,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:51:01" (1/3) ... [2024-11-19 09:51:02,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae6cfc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:51:02, skipping insertion in model container [2024-11-19 09:51:02,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:51:01" (2/3) ... [2024-11-19 09:51:02,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae6cfc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:51:02, skipping insertion in model container [2024-11-19 09:51:02,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:51:02" (3/3) ... [2024-11-19 09:51:02,839 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2024-11-19 09:51:02,852 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:51:02,852 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-19 09:51:02,853 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:51:02,903 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 09:51:02,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 156 flow [2024-11-19 09:51:02,952 INFO L124 PetriNetUnfolderBase]: 6/60 cut-off events. [2024-11-19 09:51:02,952 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 09:51:02,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 6/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-11-19 09:51:02,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 156 flow [2024-11-19 09:51:02,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 59 transitions, 142 flow [2024-11-19 09:51:02,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:51:02,970 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;@14e7027d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:51:02,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-19 09:51:02,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:51:02,973 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:51:02,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:51:02,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:02,974 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:51:02,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:02,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash 856426, now seen corresponding path program 1 times [2024-11-19 09:51:03,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970429443] [2024-11-19 09:51:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:03,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970429443] [2024-11-19 09:51:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970429443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:03,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:03,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:51:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95923461] [2024-11-19 09:51:03,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:03,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:51:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:51:03,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:51:03,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:51:03,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-11-19 09:51:03,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:03,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:51:03,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:04,102 INFO L124 PetriNetUnfolderBase]: 4566/6759 cut-off events. [2024-11-19 09:51:04,102 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2024-11-19 09:51:04,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13365 conditions, 6759 events. 4566/6759 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49799 event pairs, 4408 based on Foata normal form. 1/3814 useless extension candidates. Maximal degree in co-relation 12180. Up to 6127 conditions per place. [2024-11-19 09:51:04,145 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 34 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-19 09:51:04,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 206 flow [2024-11-19 09:51:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:51:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:51:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-19 09:51:04,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125 [2024-11-19 09:51:04,157 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 142 flow. Second operand 3 states and 111 transitions. [2024-11-19 09:51:04,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 206 flow [2024-11-19 09:51:04,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 190 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:51:04,183 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 122 flow [2024-11-19 09:51:04,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2024-11-19 09:51:04,187 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-11-19 09:51:04,188 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 122 flow [2024-11-19 09:51:04,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-11-19 09:51:04,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:04,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:51:04,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:51:04,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:04,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:04,189 INFO L85 PathProgramCache]: Analyzing trace with hash 856427, now seen corresponding path program 1 times [2024-11-19 09:51:04,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:04,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785626985] [2024-11-19 09:51:04,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:04,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:04,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785626985] [2024-11-19 09:51:04,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785626985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:04,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:51:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521834026] [2024-11-19 09:51:04,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:04,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:51:04,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:51:04,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:51:04,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:51:04,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-11-19 09:51:04,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:04,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:51:04,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:05,012 INFO L124 PetriNetUnfolderBase]: 4567/6762 cut-off events. [2024-11-19 09:51:05,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:51:05,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13060 conditions, 6762 events. 4567/6762 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 50072 event pairs, 4408 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 13031. Up to 6136 conditions per place. [2024-11-19 09:51:05,052 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 37 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2024-11-19 09:51:05,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 210 flow [2024-11-19 09:51:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:51:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:51:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2024-11-19 09:51:05,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2024-11-19 09:51:05,054 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 122 flow. Second operand 4 states and 138 transitions. [2024-11-19 09:51:05,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 210 flow [2024-11-19 09:51:05,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:51:05,056 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 145 flow [2024-11-19 09:51:05,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2024-11-19 09:51:05,057 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2024-11-19 09:51:05,057 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 145 flow [2024-11-19 09:51:05,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-11-19 09:51:05,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:05,057 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:51:05,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:51:05,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash 26551321, now seen corresponding path program 1 times [2024-11-19 09:51:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988374856] [2024-11-19 09:51:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:05,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:05,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988374856] [2024-11-19 09:51:05,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988374856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:05,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:05,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:51:05,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093862814] [2024-11-19 09:51:05,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:05,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:51:05,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:05,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:51:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:51:05,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:51:05,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:05,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:05,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:51:05,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:05,658 INFO L124 PetriNetUnfolderBase]: 4568/6765 cut-off events. [2024-11-19 09:51:05,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:51:05,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13077 conditions, 6765 events. 4568/6765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49944 event pairs, 4408 based on Foata normal form. 0/3816 useless extension candidates. Maximal degree in co-relation 13052. Up to 6135 conditions per place. [2024-11-19 09:51:05,694 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 37 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2024-11-19 09:51:05,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 239 flow [2024-11-19 09:51:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:51:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:51:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-19 09:51:05,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-11-19 09:51:05,698 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 145 flow. Second operand 5 states and 165 transitions. [2024-11-19 09:51:05,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 239 flow [2024-11-19 09:51:05,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:51:05,699 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 179 flow [2024-11-19 09:51:05,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-11-19 09:51:05,701 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2024-11-19 09:51:05,702 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 179 flow [2024-11-19 09:51:05,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:05,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:05,702 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-19 09:51:05,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:51:05,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:05,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash 823053431, now seen corresponding path program 1 times [2024-11-19 09:51:05,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:05,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130442765] [2024-11-19 09:51:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130442765] [2024-11-19 09:51:05,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130442765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:51:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604470545] [2024-11-19 09:51:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:05,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:51:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:51:05,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:51:05,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:51:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:05,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:51:05,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:51:05,959 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-11-19 09:51:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:06,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:51:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604470545] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:51:06,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:51:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-19 09:51:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196537455] [2024-11-19 09:51:06,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:51:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:51:06,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:51:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:51:06,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:51:06,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 179 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 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-11-19 09:51:06,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:06,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:51:06,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:07,004 INFO L124 PetriNetUnfolderBase]: 4568/6764 cut-off events. [2024-11-19 09:51:07,004 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:51:07,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13090 conditions, 6764 events. 4568/6764 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49749 event pairs, 4408 based on Foata normal form. 0/3818 useless extension candidates. Maximal degree in co-relation 13062. Up to 6135 conditions per place. [2024-11-19 09:51:07,041 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 36 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2024-11-19 09:51:07,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 261 flow [2024-11-19 09:51:07,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:51:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:51:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2024-11-19 09:51:07,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4817708333333333 [2024-11-19 09:51:07,044 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 179 flow. Second operand 6 states and 185 transitions. [2024-11-19 09:51:07,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 261 flow [2024-11-19 09:51:07,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:51:07,047 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 188 flow [2024-11-19 09:51:07,047 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2024-11-19 09:51:07,048 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2024-11-19 09:51:07,048 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 188 flow [2024-11-19 09:51:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 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-11-19 09:51:07,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:07,049 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-19 09:51:07,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:51:07,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:51:07,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:07,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -253956574, now seen corresponding path program 1 times [2024-11-19 09:51:07,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:07,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510514300] [2024-11-19 09:51:07,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:07,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:07,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510514300] [2024-11-19 09:51:07,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510514300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:51:07,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121624454] [2024-11-19 09:51:07,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:07,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:51:07,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:51:07,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:51:07,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:51:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:07,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:51:07,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:51:07,548 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-11-19 09:51:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:07,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:51:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121624454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:51:07,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:51:07,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-19 09:51:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727771298] [2024-11-19 09:51:07,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:51:07,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:51:07,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:07,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:51:07,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:51:07,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:51:07,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 188 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:07,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:07,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:51:07,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:08,443 INFO L124 PetriNetUnfolderBase]: 4570/6769 cut-off events. [2024-11-19 09:51:08,443 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 09:51:08,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13116 conditions, 6769 events. 4570/6769 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49937 event pairs, 4408 based on Foata normal form. 0/3823 useless extension candidates. Maximal degree in co-relation 13070. Up to 6128 conditions per place. [2024-11-19 09:51:08,473 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 30 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2024-11-19 09:51:08,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 65 transitions, 313 flow [2024-11-19 09:51:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:51:08,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:51:08,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 266 transitions. [2024-11-19 09:51:08,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2024-11-19 09:51:08,476 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 188 flow. Second operand 9 states and 266 transitions. [2024-11-19 09:51:08,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 65 transitions, 313 flow [2024-11-19 09:51:08,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 266 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-11-19 09:51:08,478 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 206 flow [2024-11-19 09:51:08,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=206, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-11-19 09:51:08,478 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-19 09:51:08,478 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 206 flow [2024-11-19 09:51:08,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:08,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:08,479 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:51:08,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:51:08,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:51:08,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:08,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:08,681 INFO L85 PathProgramCache]: Analyzing trace with hash 837386671, now seen corresponding path program 1 times [2024-11-19 09:51:08,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:08,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472493539] [2024-11-19 09:51:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:08,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:08,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472493539] [2024-11-19 09:51:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472493539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:08,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:51:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453128140] [2024-11-19 09:51:08,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:08,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:51:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:08,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:51:08,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:51:08,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:51:08,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-11-19 09:51:08,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:08,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:51:08,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:09,319 INFO L124 PetriNetUnfolderBase]: 5237/7874 cut-off events. [2024-11-19 09:51:09,320 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 09:51:09,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15248 conditions, 7874 events. 5237/7874 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 59930 event pairs, 5051 based on Foata normal form. 250/4925 useless extension candidates. Maximal degree in co-relation 13055. Up to 6142 conditions per place. [2024-11-19 09:51:09,364 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 77 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2024-11-19 09:51:09,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 476 flow [2024-11-19 09:51:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:51:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:51:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2024-11-19 09:51:09,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68359375 [2024-11-19 09:51:09,366 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 206 flow. Second operand 4 states and 175 transitions. [2024-11-19 09:51:09,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 476 flow [2024-11-19 09:51:09,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 423 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-19 09:51:09,368 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 192 flow [2024-11-19 09:51:09,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-11-19 09:51:09,369 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-11-19 09:51:09,369 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 192 flow [2024-11-19 09:51:09,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-11-19 09:51:09,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:09,371 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:51:09,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:51:09,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:09,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1472279005, now seen corresponding path program 1 times [2024-11-19 09:51:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:09,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427041284] [2024-11-19 09:51:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:51:09,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427041284] [2024-11-19 09:51:09,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427041284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:09,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:51:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070623363] [2024-11-19 09:51:09,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:09,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:51:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:51:09,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:51:09,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:51:09,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 192 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-11-19 09:51:09,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:09,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:51:09,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:09,888 INFO L124 PetriNetUnfolderBase]: 3565/5467 cut-off events. [2024-11-19 09:51:09,889 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2024-11-19 09:51:09,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11607 conditions, 5467 events. 3565/5467 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 40157 event pairs, 3430 based on Foata normal form. 0/3513 useless extension candidates. Maximal degree in co-relation 9459. Up to 4902 conditions per place. [2024-11-19 09:51:09,965 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-19 09:51:09,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 276 flow [2024-11-19 09:51:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:51:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:51:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-19 09:51:09,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4875 [2024-11-19 09:51:09,966 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 192 flow. Second operand 5 states and 156 transitions. [2024-11-19 09:51:09,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 276 flow [2024-11-19 09:51:09,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:51:09,968 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 193 flow [2024-11-19 09:51:09,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2024-11-19 09:51:09,968 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-11-19 09:51:09,968 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 193 flow [2024-11-19 09:51:09,969 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-11-19 09:51:09,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:09,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:51:09,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:51:09,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:09,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1032428682, now seen corresponding path program 1 times [2024-11-19 09:51:09,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:09,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549547443] [2024-11-19 09:51:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:10,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:10,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549547443] [2024-11-19 09:51:10,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549547443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:10,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:10,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:51:10,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60266580] [2024-11-19 09:51:10,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:10,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:51:10,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:10,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:51:10,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:51:10,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:51:10,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 193 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-11-19 09:51:10,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:10,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:51:10,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:10,238 INFO L124 PetriNetUnfolderBase]: 2317/3667 cut-off events. [2024-11-19 09:51:10,238 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2024-11-19 09:51:10,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7747 conditions, 3667 events. 2317/3667 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 26242 event pairs, 2206 based on Foata normal form. 0/2575 useless extension candidates. Maximal degree in co-relation 6246. Up to 3204 conditions per place. [2024-11-19 09:51:10,258 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 40 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2024-11-19 09:51:10,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 277 flow [2024-11-19 09:51:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:51:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:51:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-19 09:51:10,259 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2024-11-19 09:51:10,259 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 193 flow. Second operand 4 states and 130 transitions. [2024-11-19 09:51:10,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 277 flow [2024-11-19 09:51:10,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:51:10,261 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 186 flow [2024-11-19 09:51:10,261 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-11-19 09:51:10,262 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2024-11-19 09:51:10,262 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 186 flow [2024-11-19 09:51:10,262 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-11-19 09:51:10,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:10,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:51:10,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:51:10,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:10,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1032428683, now seen corresponding path program 1 times [2024-11-19 09:51:10,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321568344] [2024-11-19 09:51:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:10,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:10,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321568344] [2024-11-19 09:51:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321568344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:10,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:51:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575309524] [2024-11-19 09:51:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:10,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:51:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:51:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:51:10,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:51:10,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:10,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:10,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:51:10,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:10,662 INFO L124 PetriNetUnfolderBase]: 2874/4728 cut-off events. [2024-11-19 09:51:10,662 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2024-11-19 09:51:10,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9957 conditions, 4728 events. 2874/4728 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 36165 event pairs, 2756 based on Foata normal form. 174/3648 useless extension candidates. Maximal degree in co-relation 6246. Up to 3220 conditions per place. [2024-11-19 09:51:10,703 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 60 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2024-11-19 09:51:10,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 374 flow [2024-11-19 09:51:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:51:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:51:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2024-11-19 09:51:10,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-19 09:51:10,714 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 186 flow. Second operand 4 states and 164 transitions. [2024-11-19 09:51:10,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 374 flow [2024-11-19 09:51:10,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 82 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:51:10,716 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 200 flow [2024-11-19 09:51:10,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2024-11-19 09:51:10,717 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-11-19 09:51:10,717 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 200 flow [2024-11-19 09:51:10,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:10,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:10,717 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:51:10,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:51:10,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:10,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:10,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1472279004, now seen corresponding path program 1 times [2024-11-19 09:51:10,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281322403] [2024-11-19 09:51:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:10,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281322403] [2024-11-19 09:51:10,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281322403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:10,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:10,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:51:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893488865] [2024-11-19 09:51:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:10,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:51:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:10,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:51:10,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:51:10,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:51:10,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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-11-19 09:51:10,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:10,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:51:10,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:11,113 INFO L124 PetriNetUnfolderBase]: 1825/3123 cut-off events. [2024-11-19 09:51:11,113 INFO L125 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2024-11-19 09:51:11,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6909 conditions, 3123 events. 1825/3123 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 23086 event pairs, 1742 based on Foata normal form. 0/2521 useless extension candidates. Maximal degree in co-relation 3827. Up to 2669 conditions per place. [2024-11-19 09:51:11,131 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 38 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-11-19 09:51:11,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 276 flow [2024-11-19 09:51:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:51:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:51:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-11-19 09:51:11,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-19 09:51:11,132 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 200 flow. Second operand 4 states and 128 transitions. [2024-11-19 09:51:11,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 276 flow [2024-11-19 09:51:11,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:51:11,134 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 196 flow [2024-11-19 09:51:11,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-11-19 09:51:11,135 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-11-19 09:51:11,135 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 196 flow [2024-11-19 09:51:11,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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-11-19 09:51:11,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:11,135 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:51:11,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:51:11,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:11,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash -496370732, now seen corresponding path program 1 times [2024-11-19 09:51:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:11,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062817093] [2024-11-19 09:51:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:11,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:11,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062817093] [2024-11-19 09:51:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062817093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:51:11,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012963845] [2024-11-19 09:51:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:11,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:51:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:51:11,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:51:11,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:51:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:11,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:51:11,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:51:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:11,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:51:11,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012963845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:11,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:51:11,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-19 09:51:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943433381] [2024-11-19 09:51:11,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:51:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:51:11,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:51:11,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:51:11,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:11,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:11,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:51:11,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:11,637 INFO L124 PetriNetUnfolderBase]: 1199/2183 cut-off events. [2024-11-19 09:51:11,637 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2024-11-19 09:51:11,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4624 conditions, 2183 events. 1199/2183 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15931 event pairs, 1132 based on Foata normal form. 0/1922 useless extension candidates. Maximal degree in co-relation 3217. Up to 1784 conditions per place. [2024-11-19 09:51:11,648 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 34 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2024-11-19 09:51:11,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 268 flow [2024-11-19 09:51:11,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:51:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:51:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-19 09:51:11,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-11-19 09:51:11,649 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 196 flow. Second operand 4 states and 134 transitions. [2024-11-19 09:51:11,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 268 flow [2024-11-19 09:51:11,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:51:11,651 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 195 flow [2024-11-19 09:51:11,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-19 09:51:11,652 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2024-11-19 09:51:11,652 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 195 flow [2024-11-19 09:51:11,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:11,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:11,652 INFO L204 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] [2024-11-19 09:51:11,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:51:11,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:51:11,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:11,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash -261309294, now seen corresponding path program 1 times [2024-11-19 09:51:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366402214] [2024-11-19 09:51:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:51:11,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366402214] [2024-11-19 09:51:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366402214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:11,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:11,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:51:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354306866] [2024-11-19 09:51:11,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:11,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:51:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:51:11,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:51:11,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:51:11,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 195 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-11-19 09:51:11,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:11,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:51:11,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:12,112 INFO L124 PetriNetUnfolderBase]: 1846/3357 cut-off events. [2024-11-19 09:51:12,112 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2024-11-19 09:51:12,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7031 conditions, 3357 events. 1846/3357 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 23883 event pairs, 670 based on Foata normal form. 4/3131 useless extension candidates. Maximal degree in co-relation 5253. Up to 1537 conditions per place. [2024-11-19 09:51:12,128 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 51 selfloop transitions, 3 changer transitions 1/72 dead transitions. [2024-11-19 09:51:12,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 348 flow [2024-11-19 09:51:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:51:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:51:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-11-19 09:51:12,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-11-19 09:51:12,130 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 195 flow. Second operand 3 states and 122 transitions. [2024-11-19 09:51:12,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 348 flow [2024-11-19 09:51:12,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:51:12,132 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 209 flow [2024-11-19 09:51:12,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-11-19 09:51:12,132 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-11-19 09:51:12,132 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 209 flow [2024-11-19 09:51:12,133 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-11-19 09:51:12,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:12,133 INFO L204 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] [2024-11-19 09:51:12,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:51:12,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:12,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1644365962, now seen corresponding path program 1 times [2024-11-19 09:51:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:12,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341443087] [2024-11-19 09:51:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:51:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:12,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341443087] [2024-11-19 09:51:12,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341443087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:12,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:12,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:51:12,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102344989] [2024-11-19 09:51:12,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:12,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:51:12,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:12,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:51:12,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:51:12,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:51:12,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-11-19 09:51:12,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:12,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:51:12,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:12,434 INFO L124 PetriNetUnfolderBase]: 2074/3591 cut-off events. [2024-11-19 09:51:12,434 INFO L125 PetriNetUnfolderBase]: For 1919/1919 co-relation queries the response was YES. [2024-11-19 09:51:12,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 3591 events. 2074/3591 cut-off events. For 1919/1919 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24519 event pairs, 898 based on Foata normal form. 76/3433 useless extension candidates. Maximal degree in co-relation 6441. Up to 1602 conditions per place. [2024-11-19 09:51:12,450 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 60 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-11-19 09:51:12,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 395 flow [2024-11-19 09:51:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:51:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:51:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-11-19 09:51:12,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-19 09:51:12,456 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 209 flow. Second operand 3 states and 126 transitions. [2024-11-19 09:51:12,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 395 flow [2024-11-19 09:51:12,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 79 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:51:12,458 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 222 flow [2024-11-19 09:51:12,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2024-11-19 09:51:12,459 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2024-11-19 09:51:12,459 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 222 flow [2024-11-19 09:51:12,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-11-19 09:51:12,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:12,463 INFO L204 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] [2024-11-19 09:51:12,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:51:12,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:12,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1694686945, now seen corresponding path program 1 times [2024-11-19 09:51:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:12,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911197037] [2024-11-19 09:51:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:12,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:51:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911197037] [2024-11-19 09:51:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911197037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:51:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131430281] [2024-11-19 09:51:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:51:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:51:12,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:51:12,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:51:12,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-11-19 09:51:12,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:12,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:51:12,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:12,846 INFO L124 PetriNetUnfolderBase]: 2352/4073 cut-off events. [2024-11-19 09:51:12,846 INFO L125 PetriNetUnfolderBase]: For 3107/3107 co-relation queries the response was YES. [2024-11-19 09:51:12,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9614 conditions, 4073 events. 2352/4073 cut-off events. For 3107/3107 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27533 event pairs, 973 based on Foata normal form. 44/3889 useless extension candidates. Maximal degree in co-relation 7604. Up to 1701 conditions per place. [2024-11-19 09:51:12,875 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 60 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-11-19 09:51:12,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 415 flow [2024-11-19 09:51:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:51:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:51:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-11-19 09:51:12,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-19 09:51:12,877 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 222 flow. Second operand 3 states and 124 transitions. [2024-11-19 09:51:12,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 415 flow [2024-11-19 09:51:12,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 400 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-19 09:51:12,880 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 230 flow [2024-11-19 09:51:12,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2024-11-19 09:51:12,881 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2024-11-19 09:51:12,881 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 230 flow [2024-11-19 09:51:12,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-11-19 09:51:12,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:12,881 INFO L204 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] [2024-11-19 09:51:12,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:51:12,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1699646514, now seen corresponding path program 1 times [2024-11-19 09:51:12,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630740276] [2024-11-19 09:51:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:51:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630740276] [2024-11-19 09:51:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630740276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:51:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692421087] [2024-11-19 09:51:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:51:13,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:51:13,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:51:13,160 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:51:13,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:51:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:51:13,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:51:13,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:51:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:51:13,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:51:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:51:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692421087] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 09:51:13,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:51:13,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 5] total 16 [2024-11-19 09:51:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627500240] [2024-11-19 09:51:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:13,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:51:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:13,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:51:13,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-19 09:51:13,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2024-11-19 09:51:13,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 230 flow. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 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-11-19 09:51:13,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:13,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2024-11-19 09:51:13,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:15,884 INFO L124 PetriNetUnfolderBase]: 22778/31946 cut-off events. [2024-11-19 09:51:15,885 INFO L125 PetriNetUnfolderBase]: For 15508/15784 co-relation queries the response was YES. [2024-11-19 09:51:15,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76317 conditions, 31946 events. 22778/31946 cut-off events. For 15508/15784 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 206009 event pairs, 1016 based on Foata normal form. 20/26500 useless extension candidates. Maximal degree in co-relation 59997. Up to 4266 conditions per place. [2024-11-19 09:51:16,036 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 328 selfloop transitions, 53 changer transitions 5/394 dead transitions. [2024-11-19 09:51:16,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 394 transitions, 2000 flow [2024-11-19 09:51:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 09:51:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-19 09:51:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 750 transitions. [2024-11-19 09:51:16,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5095108695652174 [2024-11-19 09:51:16,039 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 230 flow. Second operand 23 states and 750 transitions. [2024-11-19 09:51:16,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 394 transitions, 2000 flow [2024-11-19 09:51:16,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 394 transitions, 1934 flow, removed 30 selfloop flow, removed 1 redundant places. [2024-11-19 09:51:16,050 INFO L231 Difference]: Finished difference. Result has 109 places, 113 transitions, 631 flow [2024-11-19 09:51:16,050 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=631, PETRI_PLACES=109, PETRI_TRANSITIONS=113} [2024-11-19 09:51:16,050 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 43 predicate places. [2024-11-19 09:51:16,050 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 113 transitions, 631 flow [2024-11-19 09:51:16,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 0 states have call successors, (0), 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-11-19 09:51:16,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:16,051 INFO L204 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] [2024-11-19 09:51:16,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:51:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 09:51:16,255 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 640228938, now seen corresponding path program 2 times [2024-11-19 09:51:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435069015] [2024-11-19 09:51:16,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:51:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:16,279 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:51:16,283 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:51:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:51:16,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:16,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435069015] [2024-11-19 09:51:16,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435069015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:16,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:16,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:51:16,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837521834] [2024-11-19 09:51:16,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:16,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:51:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:16,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:51:16,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:51:16,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2024-11-19 09:51:16,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 113 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:16,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:16,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2024-11-19 09:51:16,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:18,783 INFO L124 PetriNetUnfolderBase]: 15831/25163 cut-off events. [2024-11-19 09:51:18,783 INFO L125 PetriNetUnfolderBase]: For 88939/89395 co-relation queries the response was YES. [2024-11-19 09:51:18,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90804 conditions, 25163 events. 15831/25163 cut-off events. For 88939/89395 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 196561 event pairs, 2249 based on Foata normal form. 128/24857 useless extension candidates. Maximal degree in co-relation 85548. Up to 15376 conditions per place. [2024-11-19 09:51:19,018 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 138 selfloop transitions, 30 changer transitions 7/204 dead transitions. [2024-11-19 09:51:19,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 204 transitions, 1474 flow [2024-11-19 09:51:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:51:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:51:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 283 transitions. [2024-11-19 09:51:19,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.552734375 [2024-11-19 09:51:19,020 INFO L175 Difference]: Start difference. First operand has 109 places, 113 transitions, 631 flow. Second operand 8 states and 283 transitions. [2024-11-19 09:51:19,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 204 transitions, 1474 flow [2024-11-19 09:51:20,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 204 transitions, 1441 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-19 09:51:20,066 INFO L231 Difference]: Finished difference. Result has 119 places, 134 transitions, 906 flow [2024-11-19 09:51:20,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=906, PETRI_PLACES=119, PETRI_TRANSITIONS=134} [2024-11-19 09:51:20,068 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2024-11-19 09:51:20,068 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 134 transitions, 906 flow [2024-11-19 09:51:20,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:20,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:20,068 INFO L204 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] [2024-11-19 09:51:20,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:51:20,069 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:20,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1253713696, now seen corresponding path program 3 times [2024-11-19 09:51:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869086208] [2024-11-19 09:51:20,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:51:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:20,095 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:51:20,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:51:20,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:51:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869086208] [2024-11-19 09:51:20,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869086208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:20,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:20,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:51:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233483090] [2024-11-19 09:51:20,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:20,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:51:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:20,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:51:20,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:51:20,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2024-11-19 09:51:20,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 134 transitions, 906 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:20,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:20,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2024-11-19 09:51:20,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:24,683 INFO L124 PetriNetUnfolderBase]: 21866/34262 cut-off events. [2024-11-19 09:51:24,684 INFO L125 PetriNetUnfolderBase]: For 167475/170009 co-relation queries the response was YES. [2024-11-19 09:51:24,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139067 conditions, 34262 events. 21866/34262 cut-off events. For 167475/170009 co-relation queries the response was YES. Maximal size of possible extension queue 1478. Compared 268523 event pairs, 2677 based on Foata normal form. 527/33686 useless extension candidates. Maximal degree in co-relation 132561. Up to 12483 conditions per place. [2024-11-19 09:51:25,048 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 148 selfloop transitions, 73 changer transitions 13/274 dead transitions. [2024-11-19 09:51:25,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 274 transitions, 2389 flow [2024-11-19 09:51:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:51:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:51:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 320 transitions. [2024-11-19 09:51:25,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-19 09:51:25,050 INFO L175 Difference]: Start difference. First operand has 119 places, 134 transitions, 906 flow. Second operand 9 states and 320 transitions. [2024-11-19 09:51:25,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 274 transitions, 2389 flow [2024-11-19 09:51:26,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 274 transitions, 2349 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-11-19 09:51:26,619 INFO L231 Difference]: Finished difference. Result has 134 places, 183 transitions, 1650 flow [2024-11-19 09:51:26,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1650, PETRI_PLACES=134, PETRI_TRANSITIONS=183} [2024-11-19 09:51:26,620 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 68 predicate places. [2024-11-19 09:51:26,620 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 183 transitions, 1650 flow [2024-11-19 09:51:26,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:26,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:26,620 INFO L204 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] [2024-11-19 09:51:26,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:51:26,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:26,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1351889178, now seen corresponding path program 4 times [2024-11-19 09:51:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:26,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825641135] [2024-11-19 09:51:26,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:51:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:26,635 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:51:26,635 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:51:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:51:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:26,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825641135] [2024-11-19 09:51:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825641135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:26,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:51:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705248853] [2024-11-19 09:51:26,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:26,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:51:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:26,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:51:26,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:51:26,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2024-11-19 09:51:26,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 183 transitions, 1650 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:26,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:26,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2024-11-19 09:51:26,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:31,121 INFO L124 PetriNetUnfolderBase]: 21177/33335 cut-off events. [2024-11-19 09:51:31,121 INFO L125 PetriNetUnfolderBase]: For 201257/202965 co-relation queries the response was YES. [2024-11-19 09:51:31,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153911 conditions, 33335 events. 21177/33335 cut-off events. For 201257/202965 co-relation queries the response was YES. Maximal size of possible extension queue 1594. Compared 266423 event pairs, 3202 based on Foata normal form. 405/32559 useless extension candidates. Maximal degree in co-relation 148561. Up to 22621 conditions per place. [2024-11-19 09:51:31,554 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 137 selfloop transitions, 60 changer transitions 19/247 dead transitions. [2024-11-19 09:51:31,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 247 transitions, 2592 flow [2024-11-19 09:51:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:51:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:51:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-11-19 09:51:31,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5598958333333334 [2024-11-19 09:51:31,557 INFO L175 Difference]: Start difference. First operand has 134 places, 183 transitions, 1650 flow. Second operand 6 states and 215 transitions. [2024-11-19 09:51:31,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 247 transitions, 2592 flow [2024-11-19 09:51:33,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 247 transitions, 2538 flow, removed 27 selfloop flow, removed 0 redundant places. [2024-11-19 09:51:33,843 INFO L231 Difference]: Finished difference. Result has 142 places, 192 transitions, 1940 flow [2024-11-19 09:51:33,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1940, PETRI_PLACES=142, PETRI_TRANSITIONS=192} [2024-11-19 09:51:33,843 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 76 predicate places. [2024-11-19 09:51:33,843 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 192 transitions, 1940 flow [2024-11-19 09:51:33,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:33,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:33,844 INFO L204 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] [2024-11-19 09:51:33,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 09:51:33,844 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:33,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -783651606, now seen corresponding path program 5 times [2024-11-19 09:51:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:33,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492638861] [2024-11-19 09:51:33,845 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:51:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:33,863 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-19 09:51:33,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:51:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:51:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492638861] [2024-11-19 09:51:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492638861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:51:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150991111] [2024-11-19 09:51:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:34,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:51:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:34,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:51:34,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:51:34,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2024-11-19 09:51:34,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 192 transitions, 1940 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:34,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:34,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2024-11-19 09:51:34,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:41,555 INFO L124 PetriNetUnfolderBase]: 39318/59778 cut-off events. [2024-11-19 09:51:41,555 INFO L125 PetriNetUnfolderBase]: For 352735/360489 co-relation queries the response was YES. [2024-11-19 09:51:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272023 conditions, 59778 events. 39318/59778 cut-off events. For 352735/360489 co-relation queries the response was YES. Maximal size of possible extension queue 2946. Compared 485099 event pairs, 4004 based on Foata normal form. 1819/59632 useless extension candidates. Maximal degree in co-relation 262043. Up to 15660 conditions per place. [2024-11-19 09:51:42,456 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 308 selfloop transitions, 84 changer transitions 3/428 dead transitions. [2024-11-19 09:51:42,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 428 transitions, 4824 flow [2024-11-19 09:51:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:51:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:51:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 335 transitions. [2024-11-19 09:51:42,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5815972222222222 [2024-11-19 09:51:42,458 INFO L175 Difference]: Start difference. First operand has 142 places, 192 transitions, 1940 flow. Second operand 9 states and 335 transitions. [2024-11-19 09:51:42,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 428 transitions, 4824 flow [2024-11-19 09:51:48,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 428 transitions, 4711 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-19 09:51:48,006 INFO L231 Difference]: Finished difference. Result has 153 places, 241 transitions, 2720 flow [2024-11-19 09:51:48,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2720, PETRI_PLACES=153, PETRI_TRANSITIONS=241} [2024-11-19 09:51:48,006 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 87 predicate places. [2024-11-19 09:51:48,006 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 241 transitions, 2720 flow [2024-11-19 09:51:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:48,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:51:48,007 INFO L204 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] [2024-11-19 09:51:48,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 09:51:48,007 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:51:48,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:51:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash 881385570, now seen corresponding path program 6 times [2024-11-19 09:51:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:51:48,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014328961] [2024-11-19 09:51:48,008 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 09:51:48,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:51:48,024 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-19 09:51:48,024 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:51:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:51:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:51:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014328961] [2024-11-19 09:51:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014328961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:51:48,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:51:48,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:51:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062135238] [2024-11-19 09:51:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:51:48,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:51:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:51:48,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:51:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:51:48,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2024-11-19 09:51:48,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 241 transitions, 2720 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:51:48,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:51:48,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2024-11-19 09:51:48,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:51:56,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][304], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), 6#L60true, Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), 12#L141-4true, Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), 556#true, Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:56,856 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:51:56,857 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:51:56,857 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:51:56,857 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:51:57,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][304], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), 32#L142true, Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), 6#L60true, Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,016 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,017 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,017 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,017 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][304], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), 12#L141-4true, Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 37#L52true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), 556#true, Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,031 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,031 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,031 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,032 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][337], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 14#thread3EXITtrue, Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), 12#L141-4true, Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), 42#thread1EXITtrue, Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,034 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,034 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,034 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,034 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:51:57,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] L90-->L94: Formula: (let ((.cse3 (* v_~q1_front~0_114 4))) (let ((.cse4 (+ v_~q1~0.offset_89 .cse3))) (let ((.cse0 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int#1_69| v_~q1~0.base_93) .cse4))) (and (= (select |v_#valid_192| v_~q1~0.base_93) 1) (not (= (ite (or .cse0 (<= 0 .cse1)) 1 0) 0)) (= (+ v_~q1_front~0_114 1) v_~q1_front~0_113) .cse0 (not (= (ite (or .cse2 (<= .cse1 0)) 1 0) 0)) .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_97) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ .cse1 v_~total~0_98)) (<= (+ v_~q1~0.offset_89 .cse3 4) (select |v_#length_181| v_~q1~0.base_93)) (not (= (ite (and (<= 0 v_~q1_front~0_114) (< v_~q1_front~0_114 v_~q1_back~0_103) (< v_~q1_front~0_114 v_~n1~0_86)) 1 0) 0)) (<= 0 .cse4))))) InVars {~q1~0.offset=v_~q1~0.offset_89, ~q1_front~0=v_~q1_front~0_114, ~q1_back~0=v_~q1_back~0_103, ~n1~0=v_~n1~0_86, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_69|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_89, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_113, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_86, #memory_int#1=|v_#memory_int#1_69|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_103, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][297], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, 21#L94true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 575#true, Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), 12#L141-4true, Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), 42#thread1EXITtrue, Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, 200#(= (select |#valid| ~q1~0.base) 1), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2024-11-19 09:51:57,035 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,035 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,035 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,035 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][304], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), 32#L142true, Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 37#L52true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, 200#(= (select |#valid| ~q1~0.base) 1), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,378 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,378 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,378 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,378 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][337], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), 32#L142true, Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), 42#thread1EXITtrue, Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,381 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,381 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,381 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,381 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] L90-->L94: Formula: (let ((.cse3 (* v_~q1_front~0_114 4))) (let ((.cse4 (+ v_~q1~0.offset_89 .cse3))) (let ((.cse0 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int#1_69| v_~q1~0.base_93) .cse4))) (and (= (select |v_#valid_192| v_~q1~0.base_93) 1) (not (= (ite (or .cse0 (<= 0 .cse1)) 1 0) 0)) (= (+ v_~q1_front~0_114 1) v_~q1_front~0_113) .cse0 (not (= (ite (or .cse2 (<= .cse1 0)) 1 0) 0)) .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_97) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ .cse1 v_~total~0_98)) (<= (+ v_~q1~0.offset_89 .cse3 4) (select |v_#length_181| v_~q1~0.base_93)) (not (= (ite (and (<= 0 v_~q1_front~0_114) (< v_~q1_front~0_114 v_~q1_back~0_103) (< v_~q1_front~0_114 v_~n1~0_86)) 1 0) 0)) (<= 0 .cse4))))) InVars {~q1~0.offset=v_~q1~0.offset_89, ~q1_front~0=v_~q1_front~0_114, ~q1_back~0=v_~q1_back~0_103, ~n1~0=v_~n1~0_86, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_69|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_89, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_113, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_86, #memory_int#1=|v_#memory_int#1_69|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_103, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][297], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), 32#L142true, Black: 264#(= ~q1_back~0 ~q1_front~0), 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, 21#L94true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 575#true, Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), 42#thread1EXITtrue, Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, 200#(= (select |#valid| ~q1~0.base) 1), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2024-11-19 09:51:57,382 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,382 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,382 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,382 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][304], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), 12#L141-4true, Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), 42#thread1EXITtrue, Black: 195#(<= ~n1~0 0), Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 5#L76true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,395 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,395 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,395 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,395 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:51:57,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] L90-->L94: Formula: (let ((.cse3 (* v_~q1_front~0_114 4))) (let ((.cse4 (+ v_~q1~0.offset_89 .cse3))) (let ((.cse0 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int#1_69| v_~q1~0.base_93) .cse4))) (and (= (select |v_#valid_192| v_~q1~0.base_93) 1) (not (= (ite (or .cse0 (<= 0 .cse1)) 1 0) 0)) (= (+ v_~q1_front~0_114 1) v_~q1_front~0_113) .cse0 (not (= (ite (or .cse2 (<= .cse1 0)) 1 0) 0)) .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_97) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ .cse1 v_~total~0_98)) (<= (+ v_~q1~0.offset_89 .cse3 4) (select |v_#length_181| v_~q1~0.base_93)) (not (= (ite (and (<= 0 v_~q1_front~0_114) (< v_~q1_front~0_114 v_~q1_back~0_103) (< v_~q1_front~0_114 v_~n1~0_86)) 1 0) 0)) (<= 0 .cse4))))) InVars {~q1~0.offset=v_~q1~0.offset_89, ~q1_front~0=v_~q1_front~0_114, ~q1_back~0=v_~q1_back~0_103, ~n1~0=v_~n1~0_86, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_69|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_89, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_113, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_86, #memory_int#1=|v_#memory_int#1_69|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_103, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][297], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), 21#L94true, Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 575#true, Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), 12#L141-4true, Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), 42#thread1EXITtrue, Black: 195#(<= ~n1~0 0), Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), 5#L76true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, 200#(= (select |#valid| ~q1~0.base) 1), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2024-11-19 09:51:57,396 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,396 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,396 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,396 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][337], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 8#L142-1true, Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,441 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,441 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,442 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,442 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] L90-->L94: Formula: (let ((.cse3 (* v_~q1_front~0_114 4))) (let ((.cse4 (+ v_~q1~0.offset_89 .cse3))) (let ((.cse0 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int#1_69| v_~q1~0.base_93) .cse4))) (and (= (select |v_#valid_192| v_~q1~0.base_93) 1) (not (= (ite (or .cse0 (<= 0 .cse1)) 1 0) 0)) (= (+ v_~q1_front~0_114 1) v_~q1_front~0_113) .cse0 (not (= (ite (or .cse2 (<= .cse1 0)) 1 0) 0)) .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_97) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ .cse1 v_~total~0_98)) (<= (+ v_~q1~0.offset_89 .cse3 4) (select |v_#length_181| v_~q1~0.base_93)) (not (= (ite (and (<= 0 v_~q1_front~0_114) (< v_~q1_front~0_114 v_~q1_back~0_103) (< v_~q1_front~0_114 v_~n1~0_86)) 1 0) 0)) (<= 0 .cse4))))) InVars {~q1~0.offset=v_~q1~0.offset_89, ~q1_front~0=v_~q1_front~0_114, ~q1_back~0=v_~q1_back~0_103, ~n1~0=v_~n1~0_86, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_69|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_89, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_113, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_86, #memory_int#1=|v_#memory_int#1_69|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_103, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][297], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, 21#L94true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 575#true, Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), Black: 195#(<= ~n1~0 0), 63#L71true, Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 8#L142-1true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, 200#(= (select |#valid| ~q1~0.base) 1), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2024-11-19 09:51:57,442 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,442 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,442 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,442 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][304], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), 32#L142true, Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), 42#thread1EXITtrue, Black: 195#(<= ~n1~0 0), Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 5#L76true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,443 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,443 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,443 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,443 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:51:57,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] L90-->L94: Formula: (let ((.cse3 (* v_~q1_front~0_114 4))) (let ((.cse4 (+ v_~q1~0.offset_89 .cse3))) (let ((.cse0 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int#1_69| v_~q1~0.base_93) .cse4))) (and (= (select |v_#valid_192| v_~q1~0.base_93) 1) (not (= (ite (or .cse0 (<= 0 .cse1)) 1 0) 0)) (= (+ v_~q1_front~0_114 1) v_~q1_front~0_113) .cse0 (not (= (ite (or .cse2 (<= .cse1 0)) 1 0) 0)) .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_97) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ .cse1 v_~total~0_98)) (<= (+ v_~q1~0.offset_89 .cse3 4) (select |v_#length_181| v_~q1~0.base_93)) (not (= (ite (and (<= 0 v_~q1_front~0_114) (< v_~q1_front~0_114 v_~q1_back~0_103) (< v_~q1_front~0_114 v_~n1~0_86)) 1 0) 0)) (<= 0 .cse4))))) InVars {~q1~0.offset=v_~q1~0.offset_89, ~q1_front~0=v_~q1_front~0_114, ~q1_back~0=v_~q1_back~0_103, ~n1~0=v_~n1~0_86, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_69|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_89, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_113, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_86, #memory_int#1=|v_#memory_int#1_69|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_103, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][297], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), 32#L142true, Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, 21#L94true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 575#true, Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), 42#thread1EXITtrue, Black: 195#(<= ~n1~0 0), Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), 5#L76true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, 200#(= (select |#valid| ~q1~0.base) 1), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2024-11-19 09:51:57,444 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([880] L97-->thread3EXIT: Formula: (and (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_5| 256) 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_1| 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_1|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_5|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][304], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), 14#thread3EXITtrue, Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), Black: 195#(<= ~n1~0 0), Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 8#L142-1true, Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 5#L76true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), 200#(= (select |#valid| ~q1~0.base) 1), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base))), 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1)]) [2024-11-19 09:51:57,472 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,472 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,472 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,472 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:51:57,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] L90-->L94: Formula: (let ((.cse3 (* v_~q1_front~0_114 4))) (let ((.cse4 (+ v_~q1~0.offset_89 .cse3))) (let ((.cse0 (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) (.cse2 (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647)) (.cse1 (select (select |v_#memory_int#1_69| v_~q1~0.base_93) .cse4))) (and (= (select |v_#valid_192| v_~q1~0.base_93) 1) (not (= (ite (or .cse0 (<= 0 .cse1)) 1 0) 0)) (= (+ v_~q1_front~0_114 1) v_~q1_front~0_113) .cse0 (not (= (ite (or .cse2 (<= .cse1 0)) 1 0) 0)) .cse2 (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_97) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ .cse1 v_~total~0_98)) (<= (+ v_~q1~0.offset_89 .cse3 4) (select |v_#length_181| v_~q1~0.base_93)) (not (= (ite (and (<= 0 v_~q1_front~0_114) (< v_~q1_front~0_114 v_~q1_back~0_103) (< v_~q1_front~0_114 v_~n1~0_86)) 1 0) 0)) (<= 0 .cse4))))) InVars {~q1~0.offset=v_~q1~0.offset_89, ~q1_front~0=v_~q1_front~0_114, ~q1_back~0=v_~q1_back~0_103, ~n1~0=v_~n1~0_86, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_69|, ~total~0=v_~total~0_98} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_89, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_113, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_86, #memory_int#1=|v_#memory_int#1_69|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_1|, ~total~0=v_~total~0_97, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_1|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_1|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_103, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_93, #valid=|v_#valid_192|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][297], [139#(<= ~n2~0 2147483647), 630#true, Black: 260#(= ~total~0 0), Black: 264#(= ~q1_back~0 ~q1_front~0), 239#(and (<= (+ (* ~n2~0 4) ~q2~0.offset) (select |#length| ~q2~0.base)) (<= 0 ~q2~0.offset)), Black: 268#(= ~q2_back~0 ~q2_front~0), 611#true, Black: 504#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0)), 21#L94true, Black: 522#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 510#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 438#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 530#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 434#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))), Black: 514#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 516#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 526#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= ~j~0 ~i~0)), 9#thread4EXITtrue, Black: 534#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 506#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= ~j~0 ~i~0) (or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 575#true, Black: 528#(and (<= (+ ~j~0 1) ~N~0) (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 480#(or (< ~j~0 ~N~0) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 518#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1))) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 512#(and (<= (+ ~j~0 1) ~N~0) (<= ~j~0 ~i~0)), Black: 532#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256))), Black: 270#true, Black: 520#(and (<= (+ ~j~0 1) ~N~0) (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (<= ~j~0 ~i~0)), Black: 569#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), 206#(= (select |#valid| ~q2~0.base) 1), Black: 565#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (and (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (< |thread3Thread1of1ForFork0_~cond~2#1| 1) (< 0 ~N~0)) (= ~q1_back~0 ~q1_front~0)), Black: 567#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 561#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 563#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (= ~q1_back~0 ~q1_front~0)), Black: 195#(<= ~n1~0 0), Black: 586#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 588#(and (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0)))), Black: 582#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (< 0 ~N~0))), Black: 577#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0)), Black: 584#(and (= ~j~0 0) (= ~i~0 0) (= ~q1_back~0 ~q1_front~0) (<= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 578#(or (< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1) (and (= ~j~0 0) (<= 1 ~N~0))), Black: 580#(< (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 1), Black: 210#(<= ~n2~0 0), Black: 603#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0)), Black: 605#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), Black: 607#(and (<= ~q1_back~0 ~q1_front~0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork0_~cond~2#1| 0) (<= ~j~0 ~i~0) (<= ~N~0 ~i~0)), 8#L142-1true, 454#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), 5#L76true, Black: 620#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 614#(or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))), Black: 622#(and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= ~j~0 ~i~0) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)), 556#true, 200#(= (select |#valid| ~q1~0.base) 1), Black: 624#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (or (and (<= 0 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (mod |thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0)))), Black: 618#(and (or (< ~N~0 (+ ~i~0 1)) (and (<= 1 |thread2Thread1of1ForFork3_~cond~1#1|) (<= (div |thread2Thread1of1ForFork3_~cond~1#1| 256) 0))) (<= ~j~0 ~i~0)), 216#(and (= ~q1~0.offset 0) (<= (* ~n1~0 4) (select |#length| ~q1~0.base)))]) [2024-11-19 09:51:57,472 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 09:51:57,472 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:51:57,472 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:51:57,473 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:51:57,492 INFO L124 PetriNetUnfolderBase]: 42286/65002 cut-off events. [2024-11-19 09:51:57,493 INFO L125 PetriNetUnfolderBase]: For 436023/446666 co-relation queries the response was YES. [2024-11-19 09:51:58,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314126 conditions, 65002 events. 42286/65002 cut-off events. For 436023/446666 co-relation queries the response was YES. Maximal size of possible extension queue 3196. Compared 544201 event pairs, 7358 based on Foata normal form. 1548/63709 useless extension candidates. Maximal degree in co-relation 299448. Up to 39235 conditions per place. [2024-11-19 09:51:58,479 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 228 selfloop transitions, 122 changer transitions 10/393 dead transitions. [2024-11-19 09:51:58,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 393 transitions, 5045 flow [2024-11-19 09:51:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:51:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:51:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 292 transitions. [2024-11-19 09:51:58,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5703125 [2024-11-19 09:51:58,481 INFO L175 Difference]: Start difference. First operand has 153 places, 241 transitions, 2720 flow. Second operand 8 states and 292 transitions. [2024-11-19 09:51:58,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 393 transitions, 5045 flow