./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:42:39,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:42:39,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:42:39,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:42:39,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:42:39,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:42:39,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:42:39,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:42:39,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:42:39,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:42:39,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:42:39,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:42:39,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:42:39,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:42:39,776 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:42:39,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:42:39,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:42:39,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:42:39,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:42:39,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:42:39,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:42:39,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:42:39,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:39,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:39,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:42:39,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:42:39,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:42:39,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:42:39,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:39,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:42:39,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:42:39,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:42:39,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:42:39,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:42:39,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:42:39,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:42:39,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:42:39,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:42:39,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:42:39,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2025-01-09 16:42:39,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:42:39,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:42:39,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:42:39,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:42:39,969 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:42:39,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-01-09 16:42:41,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c7dbd586/6aaad751707241ffa9bf29c4ed4c3d3a/FLAG96bd8c720 [2025-01-09 16:42:41,332 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:42:41,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-01-09 16:42:41,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c7dbd586/6aaad751707241ffa9bf29c4ed4c3d3a/FLAG96bd8c720 [2025-01-09 16:42:41,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c7dbd586/6aaad751707241ffa9bf29c4ed4c3d3a [2025-01-09 16:42:41,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:42:41,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:42:41,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:41,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:42:41,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:42:41,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b84aff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41, skipping insertion in model container [2025-01-09 16:42:41,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:42:41,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-01-09 16:42:41,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:41,838 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:42:41,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-01-09 16:42:41,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:42:41,876 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:42:41,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41 WrapperNode [2025-01-09 16:42:41,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:42:41,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:41,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:42:41,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:42:41,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,930 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 289 [2025-01-09 16:42:41,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:42:41,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:42:41,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:42:41,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:42:41,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,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]. [2025-01-09 16:42:41,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:41,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:42:41,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:42:41,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:42:41,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:42:41,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (1/1) ... [2025-01-09 16:42:42,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:42:42,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:42,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:42:42,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:42:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:42:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:42:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:42:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:42:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:42:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:42:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:42:42,051 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:42:42,150 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:42:42,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:42:42,484 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:42:42,484 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:42:42,705 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:42:42,705 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:42:42,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:42 BoogieIcfgContainer [2025-01-09 16:42:42,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:42:42,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:42:42,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:42:42,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:42:42,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:42:41" (1/3) ... [2025-01-09 16:42:42,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361fae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:42, skipping insertion in model container [2025-01-09 16:42:42,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:42:41" (2/3) ... [2025-01-09 16:42:42,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361fae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:42:42, skipping insertion in model container [2025-01-09 16:42:42,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:42:42" (3/3) ... [2025-01-09 16:42:42,711 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-01-09 16:42:42,722 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:42:42,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:42:42,724 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:42:42,769 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:42:42,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 124 flow [2025-01-09 16:42:42,845 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-01-09 16:42:42,847 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:42:42,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 6/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-01-09 16:42:42,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 48 transitions, 124 flow [2025-01-09 16:42:42,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 43 transitions, 110 flow [2025-01-09 16:42:42,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:42:42,862 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;@2ee5325, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:42:42,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:42:42,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:42:42,880 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-01-09 16:42:42,880 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:42:42,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:42,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:42,881 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)] === [2025-01-09 16:42:42,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash -291499847, now seen corresponding path program 1 times [2025-01-09 16:42:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145210231] [2025-01-09 16:42:42,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:43,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:42:43,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:42:43,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:43,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:43,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:43,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145210231] [2025-01-09 16:42:43,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145210231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:43,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:43,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:42:43,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581931210] [2025-01-09 16:42:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:43,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:43,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:43,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:43,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-01-09 16:42:43,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:43,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:43,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-01-09 16:42:43,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:43,920 INFO L124 PetriNetUnfolderBase]: 1705/2599 cut-off events. [2025-01-09 16:42:43,921 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-01-09 16:42:43,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5172 conditions, 2599 events. 1705/2599 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 15240 event pairs, 201 based on Foata normal form. 120/2679 useless extension candidates. Maximal degree in co-relation 4417. Up to 1389 conditions per place. [2025-01-09 16:42:43,943 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 62 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-01-09 16:42:43,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 84 transitions, 363 flow [2025-01-09 16:42:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:42:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:42:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions. [2025-01-09 16:42:43,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6423611111111112 [2025-01-09 16:42:43,953 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 110 flow. Second operand 6 states and 185 transitions. [2025-01-09 16:42:43,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 84 transitions, 363 flow [2025-01-09 16:42:43,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 325 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:42:43,960 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 141 flow [2025-01-09 16:42:43,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-01-09 16:42:43,964 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-01-09 16:42:43,964 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 141 flow [2025-01-09 16:42:43,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:43,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:43,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:43,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:42:43,965 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)] === [2025-01-09 16:42:43,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash 337277882, now seen corresponding path program 1 times [2025-01-09 16:42:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125026840] [2025-01-09 16:42:43,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:43,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 16:42:43,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 16:42:43,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:43,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125026840] [2025-01-09 16:42:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125026840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:44,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:44,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519448076] [2025-01-09 16:42:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:42:44,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:44,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:42:44,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:42:44,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:42:44,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 141 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) [2025-01-09 16:42:44,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:44,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:42:44,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:44,442 INFO L124 PetriNetUnfolderBase]: 1602/2498 cut-off events. [2025-01-09 16:42:44,442 INFO L125 PetriNetUnfolderBase]: For 2064/2265 co-relation queries the response was YES. [2025-01-09 16:42:44,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6044 conditions, 2498 events. 1602/2498 cut-off events. For 2064/2265 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15228 event pairs, 1039 based on Foata normal form. 290/2550 useless extension candidates. Maximal degree in co-relation 2723. Up to 1963 conditions per place. [2025-01-09 16:42:44,457 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 28 selfloop transitions, 2 changer transitions 18/67 dead transitions. [2025-01-09 16:42:44,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 284 flow [2025-01-09 16:42:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:42:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:42:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-01-09 16:42:44,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2025-01-09 16:42:44,458 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 141 flow. Second operand 4 states and 131 transitions. [2025-01-09 16:42:44,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 284 flow [2025-01-09 16:42:44,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:44,461 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 154 flow [2025-01-09 16:42:44,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, 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=4, PETRI_FLOW=154, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2025-01-09 16:42:44,461 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2025-01-09 16:42:44,461 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 154 flow [2025-01-09 16:42:44,462 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) [2025-01-09 16:42:44,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:44,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:44,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:42:44,462 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)] === [2025-01-09 16:42:44,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2085565162, now seen corresponding path program 1 times [2025-01-09 16:42:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765006603] [2025-01-09 16:42:44,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:44,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:42:44,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:42:44,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:44,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:44,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:44,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765006603] [2025-01-09 16:42:44,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765006603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:44,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:44,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:42:44,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521030085] [2025-01-09 16:42:44,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:44,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:42:44,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:44,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:42:44,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:42:44,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-01-09 16:42:44,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:44,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:44,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-01-09 16:42:44,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:45,137 INFO L124 PetriNetUnfolderBase]: 2845/4445 cut-off events. [2025-01-09 16:42:45,137 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2025-01-09 16:42:45,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10727 conditions, 4445 events. 2845/4445 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 29072 event pairs, 947 based on Foata normal form. 60/4388 useless extension candidates. Maximal degree in co-relation 10712. Up to 1761 conditions per place. [2025-01-09 16:42:45,160 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 70 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2025-01-09 16:42:45,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 451 flow [2025-01-09 16:42:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:42:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:42:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2025-01-09 16:42:45,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6597222222222222 [2025-01-09 16:42:45,162 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 154 flow. Second operand 6 states and 190 transitions. [2025-01-09 16:42:45,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 451 flow [2025-01-09 16:42:45,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 441 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:45,169 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 233 flow [2025-01-09 16:42:45,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-01-09 16:42:45,169 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-01-09 16:42:45,169 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 233 flow [2025-01-09 16:42:45,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:45,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:45,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:45,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:42:45,170 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)] === [2025-01-09 16:42:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1590931808, now seen corresponding path program 1 times [2025-01-09 16:42:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:45,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77199523] [2025-01-09 16:42:45,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:45,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:42:45,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:42:45,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:45,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:45,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77199523] [2025-01-09 16:42:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77199523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235744029] [2025-01-09 16:42:45,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:45,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:45,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:45,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:45,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:42:45,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:45,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:45,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:42:45,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:45,542 INFO L124 PetriNetUnfolderBase]: 1887/3148 cut-off events. [2025-01-09 16:42:45,542 INFO L125 PetriNetUnfolderBase]: For 5615/5840 co-relation queries the response was YES. [2025-01-09 16:42:45,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8990 conditions, 3148 events. 1887/3148 cut-off events. For 5615/5840 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20712 event pairs, 297 based on Foata normal form. 183/3217 useless extension candidates. Maximal degree in co-relation 8968. Up to 2356 conditions per place. [2025-01-09 16:42:45,565 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 42 selfloop transitions, 3 changer transitions 2/69 dead transitions. [2025-01-09 16:42:45,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 69 transitions, 354 flow [2025-01-09 16:42:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-09 16:42:45,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2025-01-09 16:42:45,566 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 233 flow. Second operand 3 states and 105 transitions. [2025-01-09 16:42:45,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 69 transitions, 354 flow [2025-01-09 16:42:45,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 347 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:45,572 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 226 flow [2025-01-09 16:42:45,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-01-09 16:42:45,573 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-01-09 16:42:45,573 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 226 flow [2025-01-09 16:42:45,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:45,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:45,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:45,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:42:45,573 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)] === [2025-01-09 16:42:45,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash -674297669, now seen corresponding path program 1 times [2025-01-09 16:42:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:45,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698088826] [2025-01-09 16:42:45,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:45,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:45,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:42:45,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:42:45,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:45,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:46,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698088826] [2025-01-09 16:42:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698088826] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144281594] [2025-01-09 16:42:46,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:46,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:46,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:46,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:46,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:42:46,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 16:42:46,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 16:42:46,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:46,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 16:42:46,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:46,433 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 [2025-01-09 16:42:46,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 16:42:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:46,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:47,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-01-09 16:42:47,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-01-09 16:42:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:42:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144281594] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:47,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:47,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-09 16:42:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171938097] [2025-01-09 16:42:47,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:47,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:42:47,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:47,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:42:47,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:42:47,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:42:47,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 226 flow. Second operand has 18 states, 18 states have (on average 24.055555555555557) internal successors, (433), 18 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:47,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:47,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:42:47,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:48,808 INFO L124 PetriNetUnfolderBase]: 6611/10948 cut-off events. [2025-01-09 16:42:48,808 INFO L125 PetriNetUnfolderBase]: For 20371/21112 co-relation queries the response was YES. [2025-01-09 16:42:48,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30028 conditions, 10948 events. 6611/10948 cut-off events. For 20371/21112 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 83098 event pairs, 1282 based on Foata normal form. 767/11244 useless extension candidates. Maximal degree in co-relation 14354. Up to 3665 conditions per place. [2025-01-09 16:42:48,875 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 162 selfloop transitions, 44 changer transitions 8/236 dead transitions. [2025-01-09 16:42:48,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 236 transitions, 1337 flow [2025-01-09 16:42:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:42:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:42:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 575 transitions. [2025-01-09 16:42:48,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6655092592592593 [2025-01-09 16:42:48,877 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 226 flow. Second operand 18 states and 575 transitions. [2025-01-09 16:42:48,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 236 transitions, 1337 flow [2025-01-09 16:42:48,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 236 transitions, 1311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:42:48,893 INFO L231 Difference]: Finished difference. Result has 80 places, 98 transitions, 611 flow [2025-01-09 16:42:48,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=611, PETRI_PLACES=80, PETRI_TRANSITIONS=98} [2025-01-09 16:42:48,894 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2025-01-09 16:42:48,895 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 98 transitions, 611 flow [2025-01-09 16:42:48,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 24.055555555555557) internal successors, (433), 18 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:48,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:48,895 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 16:42:48,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:42:49,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:49,096 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)] === [2025-01-09 16:42:49,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1168489677, now seen corresponding path program 1 times [2025-01-09 16:42:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:49,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043982083] [2025-01-09 16:42:49,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:49,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:49,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:42:49,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:42:49,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:49,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:42:49,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:49,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043982083] [2025-01-09 16:42:49,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043982083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:49,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063619527] [2025-01-09 16:42:49,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:49,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:49,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:49,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:49,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:42:50,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:42:50,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:42:50,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:50,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:50,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 16:42:50,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:50,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-01-09 16:42:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:42:50,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:50,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:42:50,249 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 18 [2025-01-09 16:42:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:42:50,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063619527] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:50,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:50,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 14 [2025-01-09 16:42:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339226989] [2025-01-09 16:42:50,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:50,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:42:50,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:50,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:42:50,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:42:50,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:42:50,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 98 transitions, 611 flow. Second operand has 15 states, 15 states have (on average 24.933333333333334) internal successors, (374), 15 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:50,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:50,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:42:50,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:52,100 INFO L124 PetriNetUnfolderBase]: 8138/13531 cut-off events. [2025-01-09 16:42:52,100 INFO L125 PetriNetUnfolderBase]: For 37965/38903 co-relation queries the response was YES. [2025-01-09 16:42:52,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42167 conditions, 13531 events. 8138/13531 cut-off events. For 37965/38903 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 105596 event pairs, 973 based on Foata normal form. 711/13720 useless extension candidates. Maximal degree in co-relation 28423. Up to 5321 conditions per place. [2025-01-09 16:42:52,198 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 104 selfloop transitions, 62 changer transitions 5/193 dead transitions. [2025-01-09 16:42:52,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 193 transitions, 1389 flow [2025-01-09 16:42:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 16:42:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 16:42:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 452 transitions. [2025-01-09 16:42:52,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885416666666666 [2025-01-09 16:42:52,205 INFO L175 Difference]: Start difference. First operand has 80 places, 98 transitions, 611 flow. Second operand 16 states and 452 transitions. [2025-01-09 16:42:52,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 193 transitions, 1389 flow [2025-01-09 16:42:52,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 193 transitions, 1367 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:52,248 INFO L231 Difference]: Finished difference. Result has 97 places, 126 transitions, 996 flow [2025-01-09 16:42:52,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=996, PETRI_PLACES=97, PETRI_TRANSITIONS=126} [2025-01-09 16:42:52,249 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 47 predicate places. [2025-01-09 16:42:52,250 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 126 transitions, 996 flow [2025-01-09 16:42:52,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 24.933333333333334) internal successors, (374), 15 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:52,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:52,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:52,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:42:52,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:52,451 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)] === [2025-01-09 16:42:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 434865632, now seen corresponding path program 1 times [2025-01-09 16:42:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971985128] [2025-01-09 16:42:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:52,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 16:42:52,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 16:42:52,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:52,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:52,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971985128] [2025-01-09 16:42:52,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971985128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:52,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:42:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885794549] [2025-01-09 16:42:52,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:52,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:42:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:52,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:42:52,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:42:52,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:42:52,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 126 transitions, 996 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:52,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:52,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:42:52,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:53,946 INFO L124 PetriNetUnfolderBase]: 11243/18233 cut-off events. [2025-01-09 16:42:53,946 INFO L125 PetriNetUnfolderBase]: For 81170/82726 co-relation queries the response was YES. [2025-01-09 16:42:53,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59923 conditions, 18233 events. 11243/18233 cut-off events. For 81170/82726 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 140045 event pairs, 3055 based on Foata normal form. 1592/19037 useless extension candidates. Maximal degree in co-relation 59870. Up to 9921 conditions per place. [2025-01-09 16:42:54,047 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 141 selfloop transitions, 10 changer transitions 0/173 dead transitions. [2025-01-09 16:42:54,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 173 transitions, 1763 flow [2025-01-09 16:42:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:42:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:42:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-01-09 16:42:54,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7430555555555556 [2025-01-09 16:42:54,052 INFO L175 Difference]: Start difference. First operand has 97 places, 126 transitions, 996 flow. Second operand 3 states and 107 transitions. [2025-01-09 16:42:54,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 173 transitions, 1763 flow [2025-01-09 16:42:54,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 173 transitions, 1719 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-01-09 16:42:54,094 INFO L231 Difference]: Finished difference. Result has 96 places, 127 transitions, 1018 flow [2025-01-09 16:42:54,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1018, PETRI_PLACES=96, PETRI_TRANSITIONS=127} [2025-01-09 16:42:54,096 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2025-01-09 16:42:54,096 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 127 transitions, 1018 flow [2025-01-09 16:42:54,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:54,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:54,096 INFO L206 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] [2025-01-09 16:42:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:42:54,096 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)] === [2025-01-09 16:42:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1026249194, now seen corresponding path program 2 times [2025-01-09 16:42:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487544509] [2025-01-09 16:42:54,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:54,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-01-09 16:42:54,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:54,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:54,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:54,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:54,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487544509] [2025-01-09 16:42:54,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487544509] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:42:54,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596321044] [2025-01-09 16:42:54,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:42:54,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:54,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:42:54,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:42:54,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:42:54,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-01-09 16:42:54,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:42:54,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:42:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:54,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:42:54,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:42:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:54,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:42:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596321044] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:42:54,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:42:54,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2025-01-09 16:42:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739360162] [2025-01-09 16:42:54,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:42:54,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:42:54,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:54,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:42:54,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:42:54,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:42:54,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 127 transitions, 1018 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:54,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:54,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:42:54,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:42:57,244 INFO L124 PetriNetUnfolderBase]: 18208/30020 cut-off events. [2025-01-09 16:42:57,244 INFO L125 PetriNetUnfolderBase]: For 115339/116625 co-relation queries the response was YES. [2025-01-09 16:42:57,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101514 conditions, 30020 events. 18208/30020 cut-off events. For 115339/116625 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 255338 event pairs, 3062 based on Foata normal form. 1243/30077 useless extension candidates. Maximal degree in co-relation 101466. Up to 12742 conditions per place. [2025-01-09 16:42:57,513 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 138 selfloop transitions, 47 changer transitions 0/207 dead transitions. [2025-01-09 16:42:57,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 207 transitions, 1973 flow [2025-01-09 16:42:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:42:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:42:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-01-09 16:42:57,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78125 [2025-01-09 16:42:57,517 INFO L175 Difference]: Start difference. First operand has 96 places, 127 transitions, 1018 flow. Second operand 4 states and 150 transitions. [2025-01-09 16:42:57,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 207 transitions, 1973 flow [2025-01-09 16:42:57,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 207 transitions, 1961 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:42:57,791 INFO L231 Difference]: Finished difference. Result has 100 places, 153 transitions, 1570 flow [2025-01-09 16:42:57,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1570, PETRI_PLACES=100, PETRI_TRANSITIONS=153} [2025-01-09 16:42:57,795 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 50 predicate places. [2025-01-09 16:42:57,795 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 1570 flow [2025-01-09 16:42:57,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:57,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:42:57,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:42:57,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:42:57,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:42:57,996 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)] === [2025-01-09 16:42:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:42:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1662973007, now seen corresponding path program 1 times [2025-01-09 16:42:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:42:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159906875] [2025-01-09 16:42:57,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:42:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:42:58,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 16:42:58,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 16:42:58,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:42:58,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:42:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:42:58,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:42:58,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159906875] [2025-01-09 16:42:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159906875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:42:58,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:42:58,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:42:58,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989973578] [2025-01-09 16:42:58,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:42:58,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:42:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:42:58,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:42:58,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:42:58,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:42:58,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 1570 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:42:58,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:42:58,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:42:58,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:00,842 INFO L124 PetriNetUnfolderBase]: 20303/33391 cut-off events. [2025-01-09 16:43:00,842 INFO L125 PetriNetUnfolderBase]: For 188844/191006 co-relation queries the response was YES. [2025-01-09 16:43:00,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123976 conditions, 33391 events. 20303/33391 cut-off events. For 188844/191006 co-relation queries the response was YES. Maximal size of possible extension queue 1581. Compared 290449 event pairs, 13178 based on Foata normal form. 2658/33684 useless extension candidates. Maximal degree in co-relation 123920. Up to 19414 conditions per place. [2025-01-09 16:43:01,109 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 153 selfloop transitions, 11 changer transitions 7/193 dead transitions. [2025-01-09 16:43:01,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 193 transitions, 2358 flow [2025-01-09 16:43:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:43:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:43:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-01-09 16:43:01,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-01-09 16:43:01,111 INFO L175 Difference]: Start difference. First operand has 100 places, 153 transitions, 1570 flow. Second operand 4 states and 132 transitions. [2025-01-09 16:43:01,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 193 transitions, 2358 flow [2025-01-09 16:43:01,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 193 transitions, 2340 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:01,232 INFO L231 Difference]: Finished difference. Result has 103 places, 147 transitions, 1525 flow [2025-01-09 16:43:01,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1525, PETRI_PLACES=103, PETRI_TRANSITIONS=147} [2025-01-09 16:43:01,234 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 53 predicate places. [2025-01-09 16:43:01,234 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 147 transitions, 1525 flow [2025-01-09 16:43:01,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:01,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:01,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:01,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:43:01,235 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)] === [2025-01-09 16:43:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 645322063, now seen corresponding path program 3 times [2025-01-09 16:43:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:01,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479786578] [2025-01-09 16:43:01,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:01,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 3 equivalence classes. [2025-01-09 16:43:01,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 16:43:01,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 16:43:01,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:02,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:02,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479786578] [2025-01-09 16:43:02,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479786578] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146803558] [2025-01-09 16:43:02,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:02,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:02,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:02,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:02,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:43:02,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 3 equivalence classes. [2025-01-09 16:43:02,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 16:43:02,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 16:43:02,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:02,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 16:43:02,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:03,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:43:03,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-01-09 16:43:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:03,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:03,486 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2025-01-09 16:43:03,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 41 [2025-01-09 16:43:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:03,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146803558] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:03,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-09 16:43:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55665] [2025-01-09 16:43:03,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:43:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:03,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:43:03,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:43:03,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-01-09 16:43:03,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 147 transitions, 1525 flow. Second operand has 28 states, 28 states have (on average 23.428571428571427) internal successors, (656), 28 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:03,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:03,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-01-09 16:43:03,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:15,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 20#L143-4true, 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 97#(<= 1 ~total~0), 90#true, Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 34#L110true, 27#L56true, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:15,257 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2025-01-09 16:43:15,257 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:43:15,257 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-01-09 16:43:15,257 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:43:15,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 10#L144true, 34#L110true, 27#L56true, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:15,573 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2025-01-09 16:43:15,573 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-01-09 16:43:15,573 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-01-09 16:43:15,573 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:43:15,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 20#L143-4true, Black: 614#(= ~q1_back~0 ~q1_front~0), 44#L92true, Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 34#L110true, 27#L56true, 35#thread2EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:15,866 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-01-09 16:43:15,866 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:43:15,866 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-09 16:43:15,866 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-01-09 16:43:15,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 20#L143-4true, 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 97#(<= 1 ~total~0), Black: 76#(<= ~q1_front~0 ~q1_back~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 17#thread1EXITtrue, 34#L110true, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:15,875 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-01-09 16:43:15,875 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:43:15,875 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-09 16:43:15,875 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-01-09 16:43:15,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 20#L143-4true, 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 90#true, Black: 97#(<= 1 ~total~0), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 27#L56true, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:15,882 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-01-09 16:43:15,882 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-09 16:43:15,882 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-01-09 16:43:15,882 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-01-09 16:43:16,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 614#(= ~q1_back~0 ~q1_front~0), 44#L92true, Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 97#(<= 1 ~total~0), Black: 76#(<= ~q1_front~0 ~q1_back~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 10#L144true, 34#L110true, 27#L56true, 35#thread2EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,313 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2025-01-09 16:43:16,313 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:43:16,313 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:43:16,313 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2025-01-09 16:43:16,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 10#L144true, 34#L110true, 17#thread1EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,320 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2025-01-09 16:43:16,320 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2025-01-09 16:43:16,320 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:43:16,320 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:43:16,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 10#L144true, 27#L56true, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,326 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2025-01-09 16:43:16,327 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2025-01-09 16:43:16,328 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2025-01-09 16:43:16,328 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-09 16:43:16,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 20#L143-4true, Black: 614#(= ~q1_back~0 ~q1_front~0), 44#L92true, Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 34#L110true, 17#thread1EXITtrue, 35#thread2EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,647 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2025-01-09 16:43:16,647 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-09 16:43:16,648 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-01-09 16:43:16,648 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:43:16,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 20#L143-4true, 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), 90#true, Black: 97#(<= 1 ~total~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 27#L56true, 35#thread2EXITtrue, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,656 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2025-01-09 16:43:16,656 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-01-09 16:43:16,657 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-09 16:43:16,657 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:43:16,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 90#true, Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 5#L144-1true, 34#L110true, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,662 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2025-01-09 16:43:16,662 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-09 16:43:16,662 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-01-09 16:43:16,662 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:43:16,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 20#L143-4true, 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 97#(<= 1 ~total~0), 90#true, Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 17#thread1EXITtrue, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,664 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2025-01-09 16:43:16,664 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2025-01-09 16:43:16,664 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-01-09 16:43:16,664 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-09 16:43:16,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 614#(= ~q1_back~0 ~q1_front~0), 44#L92true, Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 97#(<= 1 ~total~0), 90#true, Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 10#L144true, 34#L110true, 17#thread1EXITtrue, 35#thread2EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,841 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-01-09 16:43:16,841 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:43:16,841 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 16:43:16,841 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-01-09 16:43:16,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 90#true, Black: 97#(<= 1 ~total~0), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 10#L144true, 27#L56true, 35#thread2EXITtrue, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,849 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-01-09 16:43:16,849 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-01-09 16:43:16,849 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:43:16,849 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 16:43:16,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 10#L144true, 17#thread1EXITtrue, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:16,856 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2025-01-09 16:43:16,856 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2025-01-09 16:43:16,856 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-09 16:43:16,856 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 16:43:17,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 90#true, Black: 97#(<= 1 ~total~0), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 5#L144-1true, 34#L110true, 35#thread2EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:17,002 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-01-09 16:43:17,003 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-01-09 16:43:17,003 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-01-09 16:43:17,003 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:43:17,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 20#L143-4true, Black: 614#(= ~q1_back~0 ~q1_front~0), 44#L92true, Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 17#thread1EXITtrue, 35#thread2EXITtrue, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:17,004 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-01-09 16:43:17,004 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-01-09 16:43:17,004 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:43:17,004 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-01-09 16:43:17,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 97#(<= 1 ~total~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 36#L74true, 343#true, 5#L144-1true, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:17,010 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2025-01-09 16:43:17,010 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2025-01-09 16:43:17,010 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2025-01-09 16:43:17,010 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-09 16:43:17,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 614#(= ~q1_back~0 ~q1_front~0), 44#L92true, Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 97#(<= 1 ~total~0), Black: 76#(<= ~q1_front~0 ~q1_back~0), 90#true, Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 10#L144true, 17#thread1EXITtrue, 35#thread2EXITtrue, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:17,128 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-01-09 16:43:17,128 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:43:17,128 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-01-09 16:43:17,129 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2025-01-09 16:43:17,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 44#L92true, Black: 614#(= ~q1_back~0 ~q1_front~0), Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 90#true, Black: 97#(<= 1 ~total~0), Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 37#L145true, 343#true, 34#L110true, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:17,129 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2025-01-09 16:43:17,129 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-09 16:43:17,129 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2025-01-09 16:43:17,129 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2025-01-09 16:43:17,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 614#(= ~q1_back~0 ~q1_front~0), 44#L92true, Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 97#(<= 1 ~total~0), 90#true, Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 343#true, 5#L144-1true, 35#thread2EXITtrue, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:17,226 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2025-01-09 16:43:17,226 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-09 16:43:17,226 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2025-01-09 16:43:17,226 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2025-01-09 16:43:17,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L88-->L92: Formula: (and (not (= (ite (or (<= v_~total~0_122 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~total~0_121 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (<= v_~total~0_121 2147483647) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_103) (+ v_~q1~0.offset_103 (* v_~q1_front~0_131 4))))) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (<= 0 v_~q1_front~0_131) (< v_~q1_front~0_131 v_~q1_back~0_129) (< v_~q1_front~0_131 v_~n1~0_58)) 1 0) 0)) (= (+ v_~q1_front~0_131 1) v_~q1_front~0_130)) InVars {~q1~0.offset=v_~q1~0.offset_103, ~q1_front~0=v_~q1_front~0_131, ~q1_back~0=v_~q1_back~0_129, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_103, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_103, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~q1_front~0=v_~q1_front~0_130, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_129, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_103, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][389], [Black: 61#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 64#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 62#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 614#(= ~q1_back~0 ~q1_front~0), 44#L92true, Black: 598#(<= ~q1_back~0 (+ ~q1_front~0 1)), 839#true, Black: 70#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 842#(<= ~n2~0 0), Black: 587#(and (= ~total~0 0) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or (< 0 ~q1_back~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|))) (or (and (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))) (or (and (<= 1 ~q1_back~0) (or (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0))) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~n1~0 (+ ~q1_back~0 1)))) (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (= ~q1~0.offset 0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (<= 0 ~q1~0.offset)) (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 351#(<= 1 ~total~0), Black: 355#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 593#(<= ~q2_back~0 ~q2_front~0), Black: 337#(and (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (or (< (+ (* ~q1_back~0 4) ~q1~0.offset) 1) (< (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ 5 (* ~q1_front~0 4)))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (= ~total~0 0) (<= 1 ~C~0))) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (or (< ~n1~0 (+ ~q1_front~0 1)) (and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1))), Black: 335#(and (<= 1 ~total~0) (or (< 0 (+ ~q1~0.offset (* ~q1_front~0 4) 1)) (< 0 (+ ~q1~0.offset 1))) (or (< (+ (* ~n1~0 4) ~q1~0.offset) 5) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (or (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (and (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ (* ~q1_back~0 4) (* ~n1~0 4) ~q1~0.offset) (+ (* ~q1_front~0 4) 4)) (or (< 0 (+ ~q1~0.offset 1)) (< 0 (+ (* ~q1_back~0 4) ~q1~0.offset 1))))) (<= ~n1~0 1) (or (< ~n1~0 (+ ~q1_front~0 1)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)))), Black: 77#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 80#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 97#(<= 1 ~total~0), 90#true, Black: 76#(<= ~q1_front~0 ~q1_back~0), Black: 313#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 82#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 37#L145true, 343#true, 12#thread4EXITtrue, 1095#(or (< ~q1_front~0 0) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 2)) (and (= ~q1_back~0 ~q1_front~0) (<= 1 (+ ~total~0 (* 2 ~C~0)))))]) [2025-01-09 16:43:17,304 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2025-01-09 16:43:17,304 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2025-01-09 16:43:17,304 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2025-01-09 16:43:17,305 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-01-09 16:43:17,612 INFO L124 PetriNetUnfolderBase]: 57908/98583 cut-off events. [2025-01-09 16:43:17,612 INFO L125 PetriNetUnfolderBase]: For 461639/466566 co-relation queries the response was YES. [2025-01-09 16:43:18,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341891 conditions, 98583 events. 57908/98583 cut-off events. For 461639/466566 co-relation queries the response was YES. Maximal size of possible extension queue 4270. Compared 976404 event pairs, 2177 based on Foata normal form. 6176/102765 useless extension candidates. Maximal degree in co-relation 341834. Up to 22365 conditions per place. [2025-01-09 16:43:18,497 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 630 selfloop transitions, 271 changer transitions 46/969 dead transitions. [2025-01-09 16:43:18,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 969 transitions, 8159 flow [2025-01-09 16:43:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-01-09 16:43:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-01-09 16:43:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 1902 transitions. [2025-01-09 16:43:18,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7204545454545455 [2025-01-09 16:43:18,503 INFO L175 Difference]: Start difference. First operand has 103 places, 147 transitions, 1525 flow. Second operand 55 states and 1902 transitions. [2025-01-09 16:43:18,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 969 transitions, 8159 flow [2025-01-09 16:43:18,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 969 transitions, 8140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:43:18,915 INFO L231 Difference]: Finished difference. Result has 180 places, 368 transitions, 5088 flow [2025-01-09 16:43:18,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=5088, PETRI_PLACES=180, PETRI_TRANSITIONS=368} [2025-01-09 16:43:18,917 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 130 predicate places. [2025-01-09 16:43:18,917 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 368 transitions, 5088 flow [2025-01-09 16:43:18,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 23.428571428571427) internal successors, (656), 28 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:18,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:18,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:18,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:43:19,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:43:19,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:43:19,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1785079193, now seen corresponding path program 1 times [2025-01-09 16:43:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451711336] [2025-01-09 16:43:19,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:19,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 16:43:19,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 16:43:19,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:19,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:43:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451711336] [2025-01-09 16:43:19,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451711336] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798356726] [2025-01-09 16:43:19,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:19,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:19,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:19,435 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:19,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:43:19,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 16:43:19,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 16:43:19,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:19,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:19,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 16:43:19,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:43:19,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:43:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798356726] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:20,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:20,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 25 [2025-01-09 16:43:20,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453746366] [2025-01-09 16:43:20,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:43:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:20,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:43:20,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:43:20,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2025-01-09 16:43:20,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 368 transitions, 5088 flow. Second operand has 26 states, 26 states have (on average 13.73076923076923) internal successors, (357), 26 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:20,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:20,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2025-01-09 16:43:20,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand