./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:49:36,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:49:36,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:49:36,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:49:36,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:49:36,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:49:36,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:49:36,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:49:36,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:49:36,607 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:49:36,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:49:36,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:49:36,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:49:36,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:49:36,611 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:49:36,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:49:36,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:49:36,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:49:36,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:49:36,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:49:36,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:49:36,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:49:36,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:49:36,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:49:36,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:49:36,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:49:36,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:49:36,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:49:36,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:49:36,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:49:36,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:49:36,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:49:36,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:49:36,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:49:36,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:49:36,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:49:36,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:49:36,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:49:36,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:49:36,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:49:36,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:49:36,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:49:36,620 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 [2024-11-09 02:49:36,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:49:36,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:49:36,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:49:36,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:49:36,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:49:36,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2024-11-09 02:49:38,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:49:38,569 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:49:38,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2024-11-09 02:49:38,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2e4b54f9/538ec997d7954ea6ad1759bc25860a38/FLAGe0cbb1bac [2024-11-09 02:49:38,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2e4b54f9/538ec997d7954ea6ad1759bc25860a38 [2024-11-09 02:49:38,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:49:38,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:49:38,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:49:38,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:49:38,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:49:38,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4803cf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38, skipping insertion in model container [2024-11-09 02:49:38,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:49:38,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4059,4072] [2024-11-09 02:49:38,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:49:38,854 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:49:38,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4059,4072] [2024-11-09 02:49:38,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:49:38,896 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:49:38,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38 WrapperNode [2024-11-09 02:49:38,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:49:38,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:49:38,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:49:38,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:49:38,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,941 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 256 [2024-11-09 02:49:38,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:49:38,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:49:38,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:49:38,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:49:38,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,981 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-09 02:49:38,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:38,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:39,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:49:39,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:49:39,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:49:39,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:49:39,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (1/1) ... [2024-11-09 02:49:39,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:49:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:49:39,034 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-09 02:49:39,036 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-09 02:49:39,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:49:39,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 02:49:39,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 02:49:39,074 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 02:49:39,074 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 02:49:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 02:49:39,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 02:49:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 02:49:39,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 02:49:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:49:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 02:49:39,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 02:49:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 02:49:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 02:49:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 02:49:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 02:49:39,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:49:39,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:49:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 02:49:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 02:49:39,079 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:49:39,187 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:49:39,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:49:39,631 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:49:39,632 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:49:39,946 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:49:39,947 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 02:49:39,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:49:39 BoogieIcfgContainer [2024-11-09 02:49:39,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:49:39,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:49:39,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:49:39,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:49:39,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:49:38" (1/3) ... [2024-11-09 02:49:39,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2703b6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:49:39, skipping insertion in model container [2024-11-09 02:49:39,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:38" (2/3) ... [2024-11-09 02:49:39,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2703b6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:49:39, skipping insertion in model container [2024-11-09 02:49:39,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:49:39" (3/3) ... [2024-11-09 02:49:39,958 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2024-11-09 02:49:39,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:49:39,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:49:39,977 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:49:40,044 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 02:49:40,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 130 flow [2024-11-09 02:49:40,126 INFO L124 PetriNetUnfolderBase]: 6/47 cut-off events. [2024-11-09 02:49:40,126 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 02:49:40,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 6/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-11-09 02:49:40,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 51 transitions, 130 flow [2024-11-09 02:49:40,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 116 flow [2024-11-09 02:49:40,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:49:40,157 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17b99b93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:49:40,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-09 02:49:40,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:49:40,176 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2024-11-09 02:49:40,176 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 02:49:40,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:40,178 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-09 02:49:40,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:40,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash -811056868, now seen corresponding path program 1 times [2024-11-09 02:49:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6469332] [2024-11-09 02:49:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:40,868 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-09 02:49:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:40,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6469332] [2024-11-09 02:49:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6469332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:40,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:40,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:49:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919973031] [2024-11-09 02:49:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:40,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:40,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:40,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2024-11-09 02:49:40,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:40,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:40,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2024-11-09 02:49:40,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:41,997 INFO L124 PetriNetUnfolderBase]: 6160/9047 cut-off events. [2024-11-09 02:49:41,997 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2024-11-09 02:49:42,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17724 conditions, 9047 events. 6160/9047 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 55076 event pairs, 2221 based on Foata normal form. 2/8840 useless extension candidates. Maximal degree in co-relation 16284. Up to 3674 conditions per place. [2024-11-09 02:49:42,093 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 65 selfloop transitions, 4 changer transitions 3/85 dead transitions. [2024-11-09 02:49:42,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 365 flow [2024-11-09 02:49:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:42,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-11-09 02:49:42,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2024-11-09 02:49:42,107 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 116 flow. Second operand 5 states and 159 transitions. [2024-11-09 02:49:42,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 365 flow [2024-11-09 02:49:42,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 331 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 02:49:42,136 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 124 flow [2024-11-09 02:49:42,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-09 02:49:42,144 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-11-09 02:49:42,145 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 124 flow [2024-11-09 02:49:42,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:42,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:42,145 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] [2024-11-09 02:49:42,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:49:42,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:42,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1082259351, now seen corresponding path program 1 times [2024-11-09 02:49:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372380658] [2024-11-09 02:49:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:42,249 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-09 02:49:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:42,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372380658] [2024-11-09 02:49:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372380658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:42,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:42,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:49:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018880590] [2024-11-09 02:49:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:42,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:49:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:42,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:49:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:49:42,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-11-09 02:49:42,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:42,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:42,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-11-09 02:49:42,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:42,760 INFO L124 PetriNetUnfolderBase]: 3414/5580 cut-off events. [2024-11-09 02:49:42,761 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-11-09 02:49:42,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10821 conditions, 5580 events. 3414/5580 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 36080 event pairs, 1305 based on Foata normal form. 90/5519 useless extension candidates. Maximal degree in co-relation 6911. Up to 3076 conditions per place. [2024-11-09 02:49:42,798 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 46 selfloop transitions, 2 changer transitions 3/68 dead transitions. [2024-11-09 02:49:42,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 272 flow [2024-11-09 02:49:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:49:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:49:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-11-09 02:49:42,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2024-11-09 02:49:42,802 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 124 flow. Second operand 3 states and 109 transitions. [2024-11-09 02:49:42,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 272 flow [2024-11-09 02:49:42,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:49:42,806 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 132 flow [2024-11-09 02:49:42,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-11-09 02:49:42,807 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-11-09 02:49:42,807 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 132 flow [2024-11-09 02:49:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:42,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:42,808 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, 1] [2024-11-09 02:49:42,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:49:42,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:42,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash -342713442, now seen corresponding path program 1 times [2024-11-09 02:49:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:42,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284496093] [2024-11-09 02:49:42,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:42,901 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-09 02:49:42,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284496093] [2024-11-09 02:49:42,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284496093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:42,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:42,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:49:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480872468] [2024-11-09 02:49:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:42,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:49:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:42,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:49:42,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:49:42,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-11-09 02:49:42,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:42,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:42,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-11-09 02:49:42,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:43,539 INFO L124 PetriNetUnfolderBase]: 3423/5576 cut-off events. [2024-11-09 02:49:43,539 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2024-11-09 02:49:43,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11291 conditions, 5576 events. 3423/5576 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 34201 event pairs, 1395 based on Foata normal form. 74/5462 useless extension candidates. Maximal degree in co-relation 7957. Up to 3744 conditions per place. [2024-11-09 02:49:43,565 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 42 selfloop transitions, 2 changer transitions 7/68 dead transitions. [2024-11-09 02:49:43,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 279 flow [2024-11-09 02:49:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:49:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:49:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-09 02:49:43,568 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-11-09 02:49:43,568 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 132 flow. Second operand 3 states and 108 transitions. [2024-11-09 02:49:43,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 279 flow [2024-11-09 02:49:43,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:49:43,572 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 142 flow [2024-11-09 02:49:43,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-11-09 02:49:43,573 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2024-11-09 02:49:43,574 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 142 flow [2024-11-09 02:49:43,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:43,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:43,575 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, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:43,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:49:43,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:43,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1374563807, now seen corresponding path program 1 times [2024-11-09 02:49:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:43,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664045856] [2024-11-09 02:49:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:43,753 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-09 02:49:43,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:43,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664045856] [2024-11-09 02:49:43,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664045856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:43,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:43,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:49:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749426628] [2024-11-09 02:49:43,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:43,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:49:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:43,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:49:43,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:49:43,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-11-09 02:49:43,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:43,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:43,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-11-09 02:49:43,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:44,322 INFO L124 PetriNetUnfolderBase]: 3940/6563 cut-off events. [2024-11-09 02:49:44,322 INFO L125 PetriNetUnfolderBase]: For 1135/1149 co-relation queries the response was YES. [2024-11-09 02:49:44,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13831 conditions, 6563 events. 3940/6563 cut-off events. For 1135/1149 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 42176 event pairs, 3357 based on Foata normal form. 58/6346 useless extension candidates. Maximal degree in co-relation 9911. Up to 4556 conditions per place. [2024-11-09 02:49:44,362 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 32 selfloop transitions, 2 changer transitions 25/76 dead transitions. [2024-11-09 02:49:44,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 324 flow [2024-11-09 02:49:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:49:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:49:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-11-09 02:49:44,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-09 02:49:44,364 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 142 flow. Second operand 5 states and 153 transitions. [2024-11-09 02:49:44,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 324 flow [2024-11-09 02:49:44,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:49:44,369 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 158 flow [2024-11-09 02:49:44,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-11-09 02:49:44,370 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-11-09 02:49:44,371 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 158 flow [2024-11-09 02:49:44,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:44,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:44,371 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:44,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:49:44,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1858947521, now seen corresponding path program 1 times [2024-11-09 02:49:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717163935] [2024-11-09 02:49:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:49:44,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:44,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717163935] [2024-11-09 02:49:44,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717163935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:44,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:44,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:49:44,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964647764] [2024-11-09 02:49:44,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:44,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:49:44,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:44,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:49:44,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:49:44,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-11-09 02:49:44,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-09 02:49:44,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:44,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-11-09 02:49:44,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:45,406 INFO L124 PetriNetUnfolderBase]: 4848/8041 cut-off events. [2024-11-09 02:49:45,406 INFO L125 PetriNetUnfolderBase]: For 1636/1650 co-relation queries the response was YES. [2024-11-09 02:49:45,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16962 conditions, 8041 events. 4848/8041 cut-off events. For 1636/1650 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 54038 event pairs, 4151 based on Foata normal form. 86/7726 useless extension candidates. Maximal degree in co-relation 16943. Up to 4557 conditions per place. [2024-11-09 02:49:45,453 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 33 selfloop transitions, 2 changer transitions 25/77 dead transitions. [2024-11-09 02:49:45,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 352 flow [2024-11-09 02:49:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:49:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:49:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-11-09 02:49:45,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6519607843137255 [2024-11-09 02:49:45,456 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 158 flow. Second operand 4 states and 133 transitions. [2024-11-09 02:49:45,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 352 flow [2024-11-09 02:49:45,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 336 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-09 02:49:45,464 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 162 flow [2024-11-09 02:49:45,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-11-09 02:49:45,467 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-11-09 02:49:45,467 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 162 flow [2024-11-09 02:49:45,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-09 02:49:45,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:45,470 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:45,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:49:45,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:45,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash 492940718, now seen corresponding path program 1 times [2024-11-09 02:49:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:45,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618739656] [2024-11-09 02:49:45,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:45,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 02:49:45,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618739656] [2024-11-09 02:49:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618739656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:49:45,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:49:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:49:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274844287] [2024-11-09 02:49:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:49:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:49:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:45,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:49:45,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:49:45,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-11-09 02:49:45,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-09 02:49:45,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:45,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-11-09 02:49:45,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:47,810 INFO L124 PetriNetUnfolderBase]: 17735/26583 cut-off events. [2024-11-09 02:49:47,811 INFO L125 PetriNetUnfolderBase]: For 5717/5717 co-relation queries the response was YES. [2024-11-09 02:49:47,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57910 conditions, 26583 events. 17735/26583 cut-off events. For 5717/5717 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 177302 event pairs, 1924 based on Foata normal form. 800/27215 useless extension candidates. Maximal degree in co-relation 57886. Up to 6730 conditions per place. [2024-11-09 02:49:47,945 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 113 selfloop transitions, 13 changer transitions 22/159 dead transitions. [2024-11-09 02:49:47,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 159 transitions, 763 flow [2024-11-09 02:49:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:49:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 02:49:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2024-11-09 02:49:47,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6638655462184874 [2024-11-09 02:49:47,947 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 162 flow. Second operand 7 states and 237 transitions. [2024-11-09 02:49:47,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 159 transitions, 763 flow [2024-11-09 02:49:47,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 159 transitions, 747 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-11-09 02:49:47,957 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 236 flow [2024-11-09 02:49:47,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-11-09 02:49:47,959 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2024-11-09 02:49:47,960 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 236 flow [2024-11-09 02:49:47,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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-09 02:49:47,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:47,961 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:47,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:49:47,961 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:47,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 674833818, now seen corresponding path program 2 times [2024-11-09 02:49:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:47,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547856406] [2024-11-09 02:49:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:49:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547856406] [2024-11-09 02:49:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547856406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:49:48,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687899572] [2024-11-09 02:49:48,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 02:49:48,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:48,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:49:48,254 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-09 02:49:48,256 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-09 02:49:48,367 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 02:49:48,367 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:49:48,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:49:48,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:49:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 02:49:48,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:49:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 02:49:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687899572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:49:48,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:49:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-09 02:49:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784648509] [2024-11-09 02:49:48,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:49:48,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:49:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:49:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:49:48,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-11-09 02:49:48,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 236 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 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-09 02:49:48,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:48,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-11-09 02:49:48,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:52,443 INFO L124 PetriNetUnfolderBase]: 25369/36568 cut-off events. [2024-11-09 02:49:52,444 INFO L125 PetriNetUnfolderBase]: For 20440/20440 co-relation queries the response was YES. [2024-11-09 02:49:52,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90698 conditions, 36568 events. 25369/36568 cut-off events. For 20440/20440 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 226161 event pairs, 1689 based on Foata normal form. 544/36250 useless extension candidates. Maximal degree in co-relation 90669. Up to 5468 conditions per place. [2024-11-09 02:49:52,693 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 377 selfloop transitions, 100 changer transitions 30/514 dead transitions. [2024-11-09 02:49:52,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 514 transitions, 2760 flow [2024-11-09 02:49:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 02:49:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-11-09 02:49:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 805 transitions. [2024-11-09 02:49:52,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5091714104996837 [2024-11-09 02:49:52,697 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 236 flow. Second operand 31 states and 805 transitions. [2024-11-09 02:49:52,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 514 transitions, 2760 flow [2024-11-09 02:49:52,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 514 transitions, 2741 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-11-09 02:49:52,799 INFO L231 Difference]: Finished difference. Result has 125 places, 154 transitions, 1135 flow [2024-11-09 02:49:52,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1135, PETRI_PLACES=125, PETRI_TRANSITIONS=154} [2024-11-09 02:49:52,800 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 72 predicate places. [2024-11-09 02:49:52,800 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 154 transitions, 1135 flow [2024-11-09 02:49:52,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 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-09 02:49:52,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:52,801 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:52,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 02:49:53,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:53,006 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:53,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash -450088264, now seen corresponding path program 3 times [2024-11-09 02:49:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:53,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205023992] [2024-11-09 02:49:53,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:49:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 02:49:53,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:49:53,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205023992] [2024-11-09 02:49:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205023992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:49:53,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984236410] [2024-11-09 02:49:53,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 02:49:53,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:49:53,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:49:53,343 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-09 02:49:53,344 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-09 02:49:53,458 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 02:49:53,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:49:53,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 02:49:53,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:49:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 02:49:53,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:49:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 02:49:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984236410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:49:53,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:49:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-09 02:49:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957710959] [2024-11-09 02:49:53,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:49:53,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:49:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:49:53,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:49:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:49:53,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-11-09 02:49:53,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 154 transitions, 1135 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:53,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:49:53,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-11-09 02:49:53,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:49:57,605 INFO L124 PetriNetUnfolderBase]: 19689/29138 cut-off events. [2024-11-09 02:49:57,605 INFO L125 PetriNetUnfolderBase]: For 228106/229350 co-relation queries the response was YES. [2024-11-09 02:49:57,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115394 conditions, 29138 events. 19689/29138 cut-off events. For 228106/229350 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 188666 event pairs, 1739 based on Foata normal form. 1324/29940 useless extension candidates. Maximal degree in co-relation 115336. Up to 5163 conditions per place. [2024-11-09 02:49:57,906 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 179 selfloop transitions, 80 changer transitions 35/323 dead transitions. [2024-11-09 02:49:57,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 323 transitions, 2731 flow [2024-11-09 02:49:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:49:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 02:49:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 419 transitions. [2024-11-09 02:49:57,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5134803921568627 [2024-11-09 02:49:57,908 INFO L175 Difference]: Start difference. First operand has 125 places, 154 transitions, 1135 flow. Second operand 16 states and 419 transitions. [2024-11-09 02:49:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 323 transitions, 2731 flow [2024-11-09 02:49:58,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 323 transitions, 2625 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-11-09 02:49:58,938 INFO L231 Difference]: Finished difference. Result has 140 places, 148 transitions, 1414 flow [2024-11-09 02:49:58,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1414, PETRI_PLACES=140, PETRI_TRANSITIONS=148} [2024-11-09 02:49:58,939 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 87 predicate places. [2024-11-09 02:49:58,939 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 148 transitions, 1414 flow [2024-11-09 02:49:58,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:49:58,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:49:58,940 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:49:58,955 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-09 02:49:59,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 02:49:59,141 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:49:59,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:49:59,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1877270382, now seen corresponding path program 4 times [2024-11-09 02:49:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:49:59,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721484766] [2024-11-09 02:49:59,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:49:59,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:49:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:50:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:50:00,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:50:00,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721484766] [2024-11-09 02:50:00,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721484766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:50:00,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770004319] [2024-11-09 02:50:00,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 02:50:00,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:50:00,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:50:00,816 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-09 02:50:00,818 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-09 02:50:00,919 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 02:50:00,919 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 02:50:00,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 02:50:00,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:50:01,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-09 02:50:01,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:50:01,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2024-11-09 02:50:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:50:01,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:50:02,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:50:02,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 150 [2024-11-09 02:50:02,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:50:02,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-11-09 02:50:02,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:50:02,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 157 [2024-11-09 02:50:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:50:03,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770004319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:50:03,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:50:03,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 37 [2024-11-09 02:50:03,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576134755] [2024-11-09 02:50:03,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:50:03,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 02:50:03,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:50:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 02:50:03,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 02:50:03,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51 [2024-11-09 02:50:03,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 148 transitions, 1414 flow. Second operand has 38 states, 38 states have (on average 18.68421052631579) internal successors, (710), 38 states have internal predecessors, (710), 0 states have call successors, (0), 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-09 02:50:03,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:50:03,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51 [2024-11-09 02:50:03,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:50:21,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L115-->L117: Formula: (= v_~v_assert~0_6 (ite (= (ite (<= v_~d2~0_3 (* 2 v_~W~0_2)) 1 0) 0) 0 1)) InVars {~d2~0=v_~d2~0_3, ~W~0=v_~W~0_2} OutVars{~v_assert~0=v_~v_assert~0_6, ~d2~0=v_~d2~0_3, ~W~0=v_~W~0_2} AuxVars[] AssignedVars[~v_assert~0][954], [Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 18#L51true, Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 21#L117true, 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), 16#L108true, 1185#(and (or (not (= ~back2~0 0)) (< ~front1~0 0) (and (= ~front1~0 ~back1~0) (= ~front2~0 0) (<= ~d2~0 0)) (< ~back1~0 ~front1~0)) (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 10#L143-4true, 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 95#true, Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))]) [2024-11-09 02:50:21,264 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-11-09 02:50:21,264 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:50:21,264 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:50:21,264 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 02:50:22,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L115-->L117: Formula: (= v_~v_assert~0_6 (ite (= (ite (<= v_~d2~0_3 (* 2 v_~W~0_2)) 1 0) 0) 0 1)) InVars {~d2~0=v_~d2~0_3, ~W~0=v_~W~0_2} OutVars{~v_assert~0=v_~v_assert~0_6, ~d2~0=v_~d2~0_3, ~W~0=v_~W~0_2} AuxVars[] AssignedVars[~v_assert~0][954], [Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 18#L51true, Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 21#L117true, 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), 16#L108true, 1185#(and (or (not (= ~back2~0 0)) (< ~front1~0 0) (and (= ~front1~0 ~back1~0) (= ~front2~0 0) (<= ~d2~0 0)) (< ~back1~0 ~front1~0)) (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), 95#true, Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))]) [2024-11-09 02:50:22,741 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-11-09 02:50:22,741 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-09 02:50:22,741 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-09 02:50:22,741 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-09 02:50:25,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][915], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 1167#(and (= ~v_assert~0 1) (<= ~d2~0 2) (<= 1 ~W~0)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-11-09 02:50:25,032 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-11-09 02:50:25,032 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-11-09 02:50:25,032 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-09 02:50:25,032 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-09 02:50:26,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][915], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 1167#(and (= ~v_assert~0 1) (<= ~d2~0 2) (<= 1 ~W~0)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-11-09 02:50:26,540 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-11-09 02:50:26,540 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-09 02:50:26,541 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-09 02:50:26,541 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-09 02:50:26,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][990], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-11-09 02:50:26,661 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-11-09 02:50:26,661 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-09 02:50:26,661 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-09 02:50:26,661 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-09 02:50:26,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][915], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 1167#(and (= ~v_assert~0 1) (<= ~d2~0 2) (<= 1 ~W~0)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-11-09 02:50:26,662 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-11-09 02:50:26,663 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-09 02:50:26,663 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-09 02:50:26,663 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-09 02:50:27,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][650], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 1133#(and (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-11-09 02:50:27,364 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-11-09 02:50:27,364 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-09 02:50:27,364 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-09 02:50:27,364 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-09 02:50:27,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][990], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-11-09 02:50:27,930 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-11-09 02:50:27,931 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:27,931 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:27,931 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-11-09 02:50:27,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][915], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 1167#(and (= ~v_assert~0 1) (<= ~d2~0 2) (<= 1 ~W~0)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-11-09 02:50:27,932 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-11-09 02:50:27,932 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-11-09 02:50:27,932 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:27,932 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][990], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-11-09 02:50:28,408 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-11-09 02:50:28,408 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-11-09 02:50:28,408 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,408 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][1191], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-11-09 02:50:28,411 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-11-09 02:50:28,414 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,414 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-11-09 02:50:28,414 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][650], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 1133#(and (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 78#(<= ~back1~0 ~front1~0), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-11-09 02:50:28,650 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-11-09 02:50:28,650 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,650 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,650 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-11-09 02:50:28,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][650], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 1133#(and (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 78#(<= ~back1~0 ~front1~0), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-11-09 02:50:28,661 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-11-09 02:50:28,661 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,661 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-09 02:50:28,661 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-11-09 02:50:29,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][990], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-11-09 02:50:29,179 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-11-09 02:50:29,179 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-11-09 02:50:29,179 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-09 02:50:29,179 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-09 02:50:29,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][1191], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-11-09 02:50:29,179 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-11-09 02:50:29,179 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-11-09 02:50:29,179 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-09 02:50:29,179 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-09 02:50:29,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][650], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 1133#(and (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-11-09 02:50:29,843 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-11-09 02:50:29,843 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-11-09 02:50:29,843 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-09 02:50:29,843 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-09 02:50:33,571 INFO L124 PetriNetUnfolderBase]: 98377/155904 cut-off events. [2024-11-09 02:50:33,571 INFO L125 PetriNetUnfolderBase]: For 1286686/1300037 co-relation queries the response was YES. [2024-11-09 02:50:35,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628714 conditions, 155904 events. 98377/155904 cut-off events. For 1286686/1300037 co-relation queries the response was YES. Maximal size of possible extension queue 5330. Compared 1396538 event pairs, 12123 based on Foata normal form. 3547/148421 useless extension candidates. Maximal degree in co-relation 600009. Up to 21935 conditions per place. [2024-11-09 02:50:35,905 INFO L140 encePairwiseOnDemand]: 35/51 looper letters, 976 selfloop transitions, 315 changer transitions 65/1454 dead transitions. [2024-11-09 02:50:35,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1454 transitions, 10174 flow [2024-11-09 02:50:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-11-09 02:50:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2024-11-09 02:50:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 2983 transitions. [2024-11-09 02:50:35,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5366073034718475 [2024-11-09 02:50:35,915 INFO L175 Difference]: Start difference. First operand has 140 places, 148 transitions, 1414 flow. Second operand 109 states and 2983 transitions. [2024-11-09 02:50:35,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 1454 transitions, 10174 flow [2024-11-09 02:50:55,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 1454 transitions, 9557 flow, removed 60 selfloop flow, removed 9 redundant places. [2024-11-09 02:50:55,352 INFO L231 Difference]: Finished difference. Result has 249 places, 568 transitions, 3795 flow [2024-11-09 02:50:55,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=109, PETRI_FLOW=3795, PETRI_PLACES=249, PETRI_TRANSITIONS=568} [2024-11-09 02:50:55,353 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 196 predicate places. [2024-11-09 02:50:55,353 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 568 transitions, 3795 flow [2024-11-09 02:50:55,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 18.68421052631579) internal successors, (710), 38 states have internal predecessors, (710), 0 states have call successors, (0), 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-09 02:50:55,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:50:55,354 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:50:55,366 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-09 02:50:55,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:50:55,554 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-09 02:50:55,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:50:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1745707119, now seen corresponding path program 5 times [2024-11-09 02:50:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:50:55,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010815695] [2024-11-09 02:50:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:50:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:50:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:50:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 02:50:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:50:55,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010815695] [2024-11-09 02:50:55,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010815695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:50:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309848030] [2024-11-09 02:50:55,759 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 02:50:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:50:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:50:55,761 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-09 02:50:55,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process