./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array.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-more-max-array.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 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:45:41,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:45:42,015 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:45:42,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:45:42,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:45:42,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:45:42,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:45:42,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:45:42,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:45:42,033 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:45:42,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:45:42,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:45:42,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:45:42,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:45:42,033 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:45:42,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:45:42,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:42,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:45:42,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:42,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:45:42,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:45:42,035 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 -> 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 [2025-01-09 16:45:42,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:45:42,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:45:42,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:45:42,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:45:42,290 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:45:42,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-01-09 16:45:43,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d993f91ef/2d7e1fca37fa4eeba421f1988773e73e/FLAG12286211e [2025-01-09 16:45:43,828 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:45:43,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-01-09 16:45:43,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d993f91ef/2d7e1fca37fa4eeba421f1988773e73e/FLAG12286211e [2025-01-09 16:45:43,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d993f91ef/2d7e1fca37fa4eeba421f1988773e73e [2025-01-09 16:45:43,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:45:43,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:45:43,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:45:43,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:45:43,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:45:43,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:45:43" (1/1) ... [2025-01-09 16:45:43,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fa84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:43, skipping insertion in model container [2025-01-09 16:45:43,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:45:43" (1/1) ... [2025-01-09 16:45:43,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:45:43,990 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-more-max-array.wvr.c[2592,2605] [2025-01-09 16:45:43,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:45:44,004 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:45:44,023 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-more-max-array.wvr.c[2592,2605] [2025-01-09 16:45:44,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:45:44,036 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:45:44,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44 WrapperNode [2025-01-09 16:45:44,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:45:44,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:45:44,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:45:44,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:45:44,042 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:45:44" (1/1) ... [2025-01-09 16:45:44,046 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:45:44" (1/1) ... [2025-01-09 16:45:44,061 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-01-09 16:45:44,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:45:44,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:45:44,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:45:44,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:45:44,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,089 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:45:44,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:45:44,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:45:44,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:45:44,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:45:44,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:44,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:44,133 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:45:44,136 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:45:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:45:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:45:44,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:45:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:45:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:45:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:45:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:45:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:45:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:45:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:45:44,159 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:45:44,229 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:45:44,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:45:44,451 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:45:44,452 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:45:44,592 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:45:44,592 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:45:44,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:44 BoogieIcfgContainer [2025-01-09 16:45:44,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:45:44,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:45:44,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:45:44,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:45:44,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:45:43" (1/3) ... [2025-01-09 16:45:44,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404e1767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:44, skipping insertion in model container [2025-01-09 16:45:44,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (2/3) ... [2025-01-09 16:45:44,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404e1767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:44, skipping insertion in model container [2025-01-09 16:45:44,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:44" (3/3) ... [2025-01-09 16:45:44,602 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2025-01-09 16:45:44,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:45:44,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:45:44,614 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:45:44,667 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:45:44,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-01-09 16:45:44,727 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-01-09 16:45:44,732 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:45:44,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-01-09 16:45:44,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-01-09 16:45:44,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-01-09 16:45:44,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:45:44,756 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;@6e0ab6d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:45:44,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:45:44,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:45:44,769 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-01-09 16:45:44,769 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:45:44,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:44,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:44,771 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 1 more)] === [2025-01-09 16:45:44,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:44,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1758943236, now seen corresponding path program 1 times [2025-01-09 16:45:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:44,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138223529] [2025-01-09 16:45:44,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:44,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:45:44,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:45:44,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:44,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:45,022 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:45:45,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138223529] [2025-01-09 16:45:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138223529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:45,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:45,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319898547] [2025-01-09 16:45:45,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:45,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:45,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:45,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:45,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:45:45,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:45:45,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:45,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:45:45,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:45,251 INFO L124 PetriNetUnfolderBase]: 617/948 cut-off events. [2025-01-09 16:45:45,252 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-01-09 16:45:45,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 948 events. 617/948 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3738 event pairs, 126 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 1709. Up to 677 conditions per place. [2025-01-09 16:45:45,258 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-01-09 16:45:45,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-01-09 16:45:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-01-09 16:45:45,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-01-09 16:45:45,268 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-01-09 16:45:45,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-01-09 16:45:45,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:45:45,273 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-01-09 16:45:45,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-01-09 16:45:45,277 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-01-09 16:45:45,277 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-01-09 16:45:45,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:45:45,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:45,277 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] [2025-01-09 16:45:45,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:45:45,278 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 1 more)] === [2025-01-09 16:45:45,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:45,278 INFO L85 PathProgramCache]: Analyzing trace with hash 984711051, now seen corresponding path program 1 times [2025-01-09 16:45:45,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749971247] [2025-01-09 16:45:45,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:45,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:45:45,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:45:45,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:45,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:45,434 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:45:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749971247] [2025-01-09 16:45:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749971247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:45,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:45,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946559993] [2025-01-09 16:45:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:45,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:45,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:45,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:45,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:45:45,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:45:45,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:45,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:45:45,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:45,567 INFO L124 PetriNetUnfolderBase]: 617/949 cut-off events. [2025-01-09 16:45:45,567 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-01-09 16:45:45,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 949 events. 617/949 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3903 event pairs, 407 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 793. Up to 895 conditions per place. [2025-01-09 16:45:45,572 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-01-09 16:45:45,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-01-09 16:45:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:45,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-01-09 16:45:45,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-01-09 16:45:45,573 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-01-09 16:45:45,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-01-09 16:45:45,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:45,575 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-01-09 16:45:45,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-01-09 16:45:45,575 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-01-09 16:45:45,575 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-01-09 16:45:45,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:45:45,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:45,576 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] [2025-01-09 16:45:45,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:45:45,576 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 1 more)] === [2025-01-09 16:45:45,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:45,577 INFO L85 PathProgramCache]: Analyzing trace with hash -33897561, now seen corresponding path program 1 times [2025-01-09 16:45:45,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:45,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92176133] [2025-01-09 16:45:45,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:45,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:45,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:45:45,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:45:45,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:45,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:45,657 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:45:45,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:45,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92176133] [2025-01-09 16:45:45,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92176133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:45,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:45,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:45:45,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638380363] [2025-01-09 16:45:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:45,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:45:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:45,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:45:45,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:45:45,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:45:45,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:45:45,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:45,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:45:45,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:45,819 INFO L124 PetriNetUnfolderBase]: 790/1165 cut-off events. [2025-01-09 16:45:45,819 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-01-09 16:45:45,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 1165 events. 790/1165 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4691 event pairs, 246 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 2566. Up to 576 conditions per place. [2025-01-09 16:45:45,825 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-01-09 16:45:45,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-01-09 16:45:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:45:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:45:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-01-09 16:45:45,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-01-09 16:45:45,826 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-01-09 16:45:45,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-01-09 16:45:45,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:45,829 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-01-09 16:45:45,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-01-09 16:45:45,831 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-01-09 16:45:45,831 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-01-09 16:45:45,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:45:45,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:45,831 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] [2025-01-09 16:45:45,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:45:45,832 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 1 more)] === [2025-01-09 16:45:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1754914735, now seen corresponding path program 1 times [2025-01-09 16:45:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483549153] [2025-01-09 16:45:45,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:45,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:45:45,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:45:45,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:45,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:45,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483549153] [2025-01-09 16:45:45,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483549153] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40464093] [2025-01-09 16:45:45,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:45,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:45,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:45,950 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:45:45,952 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:45:46,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:45:46,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:45:46,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:46,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:46,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:45:46,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:46,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:46,121 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:45:46,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40464093] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:46,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:45:46,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:45:46,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161740173] [2025-01-09 16:45:46,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:46,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:45:46,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:46,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:45:46,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:45:46,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:45:46,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:45:46,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:46,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:45:46,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:46,246 INFO L124 PetriNetUnfolderBase]: 855/1297 cut-off events. [2025-01-09 16:45:46,246 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2025-01-09 16:45:46,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1297 events. 855/1297 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5415 event pairs, 256 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 3229. Up to 670 conditions per place. [2025-01-09 16:45:46,253 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-01-09 16:45:46,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-01-09 16:45:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:45:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:45:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-01-09 16:45:46,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-01-09 16:45:46,254 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-01-09 16:45:46,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-01-09 16:45:46,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:46,257 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-01-09 16:45:46,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-01-09 16:45:46,257 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-01-09 16:45:46,258 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-01-09 16:45:46,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:45:46,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:46,258 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] [2025-01-09 16:45:46,265 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:45:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:46,459 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 1 more)] === [2025-01-09 16:45:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash -87306492, now seen corresponding path program 1 times [2025-01-09 16:45:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145844406] [2025-01-09 16:45:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:46,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:45:46,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:46,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:46,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:46,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:46,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145844406] [2025-01-09 16:45:46,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145844406] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:46,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084723243] [2025-01-09 16:45:46,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:46,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:46,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:46,948 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:45:46,950 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:45:46,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:45:47,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:47,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:47,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:47,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 16:45:47,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:47,061 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 15 treesize of output 1 [2025-01-09 16:45:47,271 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 55 treesize of output 31 [2025-01-09 16:45:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:47,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:48,166 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 117 treesize of output 105 [2025-01-09 16:45:48,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:45:48,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-01-09 16:45:48,806 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 93 treesize of output 85 [2025-01-09 16:45:48,829 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-01-09 16:45:48,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-01-09 16:45:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:49,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084723243] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:45:49,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:45:49,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-01-09 16:45:49,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687704763] [2025-01-09 16:45:49,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:45:49,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 16:45:49,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:49,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 16:45:49,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:45:49,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:45:49,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:49,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:49,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:45:49,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:50,630 INFO L124 PetriNetUnfolderBase]: 1841/2767 cut-off events. [2025-01-09 16:45:50,631 INFO L125 PetriNetUnfolderBase]: For 1743/1743 co-relation queries the response was YES. [2025-01-09 16:45:50,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7675 conditions, 2767 events. 1841/2767 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12671 event pairs, 98 based on Foata normal form. 1/2767 useless extension candidates. Maximal degree in co-relation 5619. Up to 1375 conditions per place. [2025-01-09 16:45:50,648 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-01-09 16:45:50,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-01-09 16:45:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:45:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:45:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-01-09 16:45:50,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-01-09 16:45:50,652 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-01-09 16:45:50,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-01-09 16:45:50,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:45:50,659 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-01-09 16:45:50,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2025-01-09 16:45:50,660 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-01-09 16:45:50,661 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-01-09 16:45:50,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:50,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:50,661 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] [2025-01-09 16:45:50,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:45:50,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:50,862 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 1 more)] === [2025-01-09 16:45:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash -545397516, now seen corresponding path program 2 times [2025-01-09 16:45:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:50,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752223079] [2025-01-09 16:45:50,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:45:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:50,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:45:50,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:50,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:45:50,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:51,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:51,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752223079] [2025-01-09 16:45:51,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752223079] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:51,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145473097] [2025-01-09 16:45:51,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:45:51,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:51,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:51,289 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:45:51,291 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:45:51,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:45:51,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:51,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:45:51,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:51,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:45:51,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:51,368 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 15 treesize of output 1 [2025-01-09 16:45:51,528 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 55 treesize of output 31 [2025-01-09 16:45:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:51,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:52,092 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 117 treesize of output 105 [2025-01-09 16:45:52,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:45:52,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-01-09 16:45:52,571 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 93 treesize of output 85 [2025-01-09 16:45:52,590 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-01-09 16:45:52,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-01-09 16:45:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145473097] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:45:53,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:45:53,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-01-09 16:45:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284081720] [2025-01-09 16:45:53,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:45:53,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:45:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:53,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:45:53,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:45:53,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:45:53,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 21 states, 21 states have (on average 9.857142857142858) internal successors, (207), 21 states have internal predecessors, (207), 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:45:53,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:53,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:45:53,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:54,472 INFO L124 PetriNetUnfolderBase]: 2050/3327 cut-off events. [2025-01-09 16:45:54,473 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2025-01-09 16:45:54,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10780 conditions, 3327 events. 2050/3327 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17965 event pairs, 122 based on Foata normal form. 3/3328 useless extension candidates. Maximal degree in co-relation 10218. Up to 1815 conditions per place. [2025-01-09 16:45:54,490 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 193 selfloop transitions, 121 changer transitions 2/322 dead transitions. [2025-01-09 16:45:54,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 322 transitions, 2167 flow [2025-01-09 16:45:54,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 16:45:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-09 16:45:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 474 transitions. [2025-01-09 16:45:54,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633431085043988 [2025-01-09 16:45:54,495 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 31 states and 474 transitions. [2025-01-09 16:45:54,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 322 transitions, 2167 flow [2025-01-09 16:45:54,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 322 transitions, 1959 flow, removed 77 selfloop flow, removed 3 redundant places. [2025-01-09 16:45:54,511 INFO L231 Difference]: Finished difference. Result has 105 places, 182 transitions, 1307 flow [2025-01-09 16:45:54,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1307, PETRI_PLACES=105, PETRI_TRANSITIONS=182} [2025-01-09 16:45:54,514 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-01-09 16:45:54,515 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 1307 flow [2025-01-09 16:45:54,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.857142857142858) internal successors, (207), 21 states have internal predecessors, (207), 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:45:54,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:54,515 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] [2025-01-09 16:45:54,523 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:45:54,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:54,720 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 1 more)] === [2025-01-09 16:45:54,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:54,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1852184804, now seen corresponding path program 3 times [2025-01-09 16:45:54,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633382065] [2025-01-09 16:45:54,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:45:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:54,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:45:54,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:54,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:45:54,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:55,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:55,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633382065] [2025-01-09 16:45:55,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633382065] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:55,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818788197] [2025-01-09 16:45:55,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:45:55,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:55,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:55,062 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:45:55,063 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:45:55,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:45:55,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:55,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:45:55,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:55,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:45:55,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:55,158 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 15 treesize of output 1 [2025-01-09 16:45:55,321 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 55 treesize of output 31 [2025-01-09 16:45:55,354 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:45:55,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:56,001 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 53 treesize of output 47 [2025-01-09 16:45:56,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:45:56,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 58 [2025-01-09 16:45:56,050 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 66 treesize of output 58 [2025-01-09 16:45:56,054 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:45:56,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 1 [2025-01-09 16:45:56,058 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 69 treesize of output 61 [2025-01-09 16:45:56,065 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 16:45:56,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2025-01-09 16:45:56,281 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:45:56,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818788197] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:45:56,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:45:56,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2025-01-09 16:45:56,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571888755] [2025-01-09 16:45:56,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:45:56,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:45:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:56,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:45:56,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:45:56,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:45:56,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 1307 flow. Second operand has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 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:45:56,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:56,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:45:56,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:58,300 INFO L124 PetriNetUnfolderBase]: 3977/6397 cut-off events. [2025-01-09 16:45:58,300 INFO L125 PetriNetUnfolderBase]: For 17112/17132 co-relation queries the response was YES. [2025-01-09 16:45:58,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24697 conditions, 6397 events. 3977/6397 cut-off events. For 17112/17132 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 38841 event pairs, 233 based on Foata normal form. 20/6415 useless extension candidates. Maximal degree in co-relation 23559. Up to 2818 conditions per place. [2025-01-09 16:45:58,400 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 242 selfloop transitions, 255 changer transitions 2/505 dead transitions. [2025-01-09 16:45:58,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 505 transitions, 4211 flow [2025-01-09 16:45:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 16:45:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-01-09 16:45:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 542 transitions. [2025-01-09 16:45:58,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4692640692640693 [2025-01-09 16:45:58,402 INFO L175 Difference]: Start difference. First operand has 105 places, 182 transitions, 1307 flow. Second operand 35 states and 542 transitions. [2025-01-09 16:45:58,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 505 transitions, 4211 flow [2025-01-09 16:45:58,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 505 transitions, 4018 flow, removed 94 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:58,455 INFO L231 Difference]: Finished difference. Result has 149 places, 342 transitions, 3150 flow [2025-01-09 16:45:58,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3150, PETRI_PLACES=149, PETRI_TRANSITIONS=342} [2025-01-09 16:45:58,456 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2025-01-09 16:45:58,456 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 342 transitions, 3150 flow [2025-01-09 16:45:58,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 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:45:58,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:58,456 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] [2025-01-09 16:45:58,463 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:45:58,657 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,SelfDestructingSolverStorable6 [2025-01-09 16:45:58,657 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 1 more)] === [2025-01-09 16:45:58,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1763820994, now seen corresponding path program 4 times [2025-01-09 16:45:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:58,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143136203] [2025-01-09 16:45:58,658 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:45:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:58,665 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:45:58,678 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:58,679 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:45:58,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:59,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:59,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143136203] [2025-01-09 16:45:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143136203] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682973379] [2025-01-09 16:45:59,024 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:45:59,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:59,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:59,026 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:45:59,030 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:45:59,068 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:45:59,083 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:59,083 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:45:59,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:59,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:45:59,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:59,109 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 15 treesize of output 1 [2025-01-09 16:45:59,294 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 55 treesize of output 31 [2025-01-09 16:45:59,322 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:45:59,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:59,762 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 66 treesize of output 58 [2025-01-09 16:45:59,768 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:45:59,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 79 [2025-01-09 16:45:59,868 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 53 treesize of output 47 [2025-01-09 16:45:59,878 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 16:45:59,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2025-01-09 16:45:59,962 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 69 treesize of output 61 [2025-01-09 16:45:59,977 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 16:45:59,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2025-01-09 16:46:00,081 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:46:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682973379] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:00,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-01-09 16:46:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060075392] [2025-01-09 16:46:00,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:00,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:46:00,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:00,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:46:00,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:46:00,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:00,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 342 transitions, 3150 flow. Second operand has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:00,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:00,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:00,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:01,860 INFO L124 PetriNetUnfolderBase]: 5882/9407 cut-off events. [2025-01-09 16:46:01,860 INFO L125 PetriNetUnfolderBase]: For 32844/32860 co-relation queries the response was YES. [2025-01-09 16:46:01,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39695 conditions, 9407 events. 5882/9407 cut-off events. For 32844/32860 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 60942 event pairs, 1227 based on Foata normal form. 18/9424 useless extension candidates. Maximal degree in co-relation 38549. Up to 6922 conditions per place. [2025-01-09 16:46:01,930 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 354 selfloop transitions, 152 changer transitions 1/512 dead transitions. [2025-01-09 16:46:01,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 512 transitions, 5265 flow [2025-01-09 16:46:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 16:46:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-09 16:46:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 370 transitions. [2025-01-09 16:46:01,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4152637485970819 [2025-01-09 16:46:01,933 INFO L175 Difference]: Start difference. First operand has 149 places, 342 transitions, 3150 flow. Second operand 27 states and 370 transitions. [2025-01-09 16:46:01,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 512 transitions, 5265 flow [2025-01-09 16:46:02,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 512 transitions, 5038 flow, removed 60 selfloop flow, removed 12 redundant places. [2025-01-09 16:46:02,021 INFO L231 Difference]: Finished difference. Result has 171 places, 413 transitions, 4060 flow [2025-01-09 16:46:02,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2938, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4060, PETRI_PLACES=171, PETRI_TRANSITIONS=413} [2025-01-09 16:46:02,021 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 136 predicate places. [2025-01-09 16:46:02,021 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 413 transitions, 4060 flow [2025-01-09 16:46:02,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:02,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:02,023 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] [2025-01-09 16:46:02,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:02,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:02,227 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 1 more)] === [2025-01-09 16:46:02,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash 982130626, now seen corresponding path program 5 times [2025-01-09 16:46:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:02,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468121734] [2025-01-09 16:46:02,227 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:02,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:02,240 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:02,241 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:02,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:02,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468121734] [2025-01-09 16:46:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468121734] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:02,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393103980] [2025-01-09 16:46:02,786 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:02,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:02,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:02,789 INFO L229 MonitoredProcess]: Starting monitored process 7 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:46:02,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:46:02,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:02,855 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:02,855 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:02,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:02,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:46:02,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:02,892 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 15 treesize of output 1 [2025-01-09 16:46:03,120 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 55 treesize of output 31 [2025-01-09 16:46:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:03,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:04,045 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 66 treesize of output 58 [2025-01-09 16:46:04,051 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:46:04,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 79 [2025-01-09 16:46:04,214 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 69 treesize of output 61 [2025-01-09 16:46:04,229 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 16:46:04,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2025-01-09 16:46:04,310 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 53 treesize of output 47 [2025-01-09 16:46:04,319 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:46:04,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2025-01-09 16:46:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393103980] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:04,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:04,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 16:46:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742896525] [2025-01-09 16:46:04,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:04,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:46:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:04,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:46:04,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:46:04,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:46:04,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 413 transitions, 4060 flow. Second operand has 28 states, 28 states have (on average 7.535714285714286) internal successors, (211), 28 states have internal predecessors, (211), 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:46:04,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:04,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:46:04,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:07,534 INFO L124 PetriNetUnfolderBase]: 10102/14626 cut-off events. [2025-01-09 16:46:07,534 INFO L125 PetriNetUnfolderBase]: For 55807/55807 co-relation queries the response was YES. [2025-01-09 16:46:07,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64661 conditions, 14626 events. 10102/14626 cut-off events. For 55807/55807 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 84423 event pairs, 1608 based on Foata normal form. 4/14627 useless extension candidates. Maximal degree in co-relation 63481. Up to 9930 conditions per place. [2025-01-09 16:46:07,697 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 459 selfloop transitions, 327 changer transitions 2/790 dead transitions. [2025-01-09 16:46:07,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 790 transitions, 8669 flow [2025-01-09 16:46:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 16:46:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-01-09 16:46:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 441 transitions. [2025-01-09 16:46:07,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2025-01-09 16:46:07,702 INFO L175 Difference]: Start difference. First operand has 171 places, 413 transitions, 4060 flow. Second operand 33 states and 441 transitions. [2025-01-09 16:46:07,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 790 transitions, 8669 flow [2025-01-09 16:46:07,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 790 transitions, 8302 flow, removed 117 selfloop flow, removed 9 redundant places. [2025-01-09 16:46:07,920 INFO L231 Difference]: Finished difference. Result has 204 places, 622 transitions, 7047 flow [2025-01-09 16:46:07,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3789, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=7047, PETRI_PLACES=204, PETRI_TRANSITIONS=622} [2025-01-09 16:46:07,922 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 169 predicate places. [2025-01-09 16:46:07,922 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 622 transitions, 7047 flow [2025-01-09 16:46:07,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.535714285714286) internal successors, (211), 28 states have internal predecessors, (211), 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:46:07,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:07,923 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] [2025-01-09 16:46:07,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:46:08,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 16:46:08,125 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 1 more)] === [2025-01-09 16:46:08,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash -421137092, now seen corresponding path program 6 times [2025-01-09 16:46:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:08,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552815115] [2025-01-09 16:46:08,125 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:08,131 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:46:08,139 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-01-09 16:46:08,139 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:46:08,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552815115] [2025-01-09 16:46:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552815115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:08,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050901310] [2025-01-09 16:46:08,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:08,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:08,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:08,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:08,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:08,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:08,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 622 transitions, 7047 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:08,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:08,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:08,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:09,993 INFO L124 PetriNetUnfolderBase]: 7745/11970 cut-off events. [2025-01-09 16:46:09,993 INFO L125 PetriNetUnfolderBase]: For 65362/65466 co-relation queries the response was YES. [2025-01-09 16:46:10,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60292 conditions, 11970 events. 7745/11970 cut-off events. For 65362/65466 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 75638 event pairs, 1300 based on Foata normal form. 11/11978 useless extension candidates. Maximal degree in co-relation 59539. Up to 9910 conditions per place. [2025-01-09 16:46:10,060 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 560 selfloop transitions, 147 changer transitions 1/713 dead transitions. [2025-01-09 16:46:10,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 713 transitions, 9256 flow [2025-01-09 16:46:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2025-01-09 16:46:10,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49393939393939396 [2025-01-09 16:46:10,062 INFO L175 Difference]: Start difference. First operand has 204 places, 622 transitions, 7047 flow. Second operand 10 states and 163 transitions. [2025-01-09 16:46:10,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 713 transitions, 9256 flow [2025-01-09 16:46:10,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 713 transitions, 8814 flow, removed 181 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:10,448 INFO L231 Difference]: Finished difference. Result has 210 places, 660 transitions, 7540 flow [2025-01-09 16:46:10,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6623, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7540, PETRI_PLACES=210, PETRI_TRANSITIONS=660} [2025-01-09 16:46:10,449 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 175 predicate places. [2025-01-09 16:46:10,449 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 660 transitions, 7540 flow [2025-01-09 16:46:10,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:10,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:10,450 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] [2025-01-09 16:46:10,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:46:10,450 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 1 more)] === [2025-01-09 16:46:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash 425169366, now seen corresponding path program 7 times [2025-01-09 16:46:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:10,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520203267] [2025-01-09 16:46:10,450 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:10,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:46:10,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:10,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:10,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:10,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520203267] [2025-01-09 16:46:10,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520203267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:10,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211226144] [2025-01-09 16:46:10,510 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:10,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:10,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:10,512 INFO L229 MonitoredProcess]: Starting monitored process 8 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:46:10,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:46:10,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:46:10,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:10,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:10,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:10,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:46:10,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:10,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211226144] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:10,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:46:10,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-01-09 16:46:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017977492] [2025-01-09 16:46:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:10,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:46:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:10,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:46:10,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:46:10,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:10,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 660 transitions, 7540 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:46:10,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:10,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:10,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:12,427 INFO L124 PetriNetUnfolderBase]: 8690/13297 cut-off events. [2025-01-09 16:46:12,427 INFO L125 PetriNetUnfolderBase]: For 88866/89235 co-relation queries the response was YES. [2025-01-09 16:46:12,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69077 conditions, 13297 events. 8690/13297 cut-off events. For 88866/89235 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 85166 event pairs, 1743 based on Foata normal form. 342/13635 useless extension candidates. Maximal degree in co-relation 68984. Up to 4450 conditions per place. [2025-01-09 16:46:12,541 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 727 selfloop transitions, 80 changer transitions 0/812 dead transitions. [2025-01-09 16:46:12,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 812 transitions, 10649 flow [2025-01-09 16:46:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:46:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:46:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-01-09 16:46:12,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-01-09 16:46:12,543 INFO L175 Difference]: Start difference. First operand has 210 places, 660 transitions, 7540 flow. Second operand 8 states and 144 transitions. [2025-01-09 16:46:12,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 812 transitions, 10649 flow [2025-01-09 16:46:12,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 812 transitions, 10517 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:12,884 INFO L231 Difference]: Finished difference. Result has 215 places, 654 transitions, 7538 flow [2025-01-09 16:46:12,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7147, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7538, PETRI_PLACES=215, PETRI_TRANSITIONS=654} [2025-01-09 16:46:12,885 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 180 predicate places. [2025-01-09 16:46:12,885 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 654 transitions, 7538 flow [2025-01-09 16:46:12,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:46:12,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:12,886 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 16:46:12,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:46:13,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:13,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:13,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash 445950931, now seen corresponding path program 8 times [2025-01-09 16:46:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613954870] [2025-01-09 16:46:13,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:13,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:13,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:13,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:13,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:13,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613954870] [2025-01-09 16:46:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613954870] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663611740] [2025-01-09 16:46:13,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:13,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:13,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:13,213 INFO L229 MonitoredProcess]: Starting monitored process 9 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:46:13,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:46:13,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:13,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:13,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:13,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:13,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:46:13,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:13,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663611740] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:13,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:13,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-09 16:46:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571102019] [2025-01-09 16:46:13,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:13,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:46:13,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:13,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:46:13,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:46:13,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:46:13,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 654 transitions, 7538 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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:46:13,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:13,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:46:13,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:16,916 INFO L124 PetriNetUnfolderBase]: 18829/27190 cut-off events. [2025-01-09 16:46:16,916 INFO L125 PetriNetUnfolderBase]: For 207743/207743 co-relation queries the response was YES. [2025-01-09 16:46:17,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142971 conditions, 27190 events. 18829/27190 cut-off events. For 207743/207743 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 171459 event pairs, 2772 based on Foata normal form. 28/27218 useless extension candidates. Maximal degree in co-relation 141230. Up to 6914 conditions per place. [2025-01-09 16:46:17,095 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 1699 selfloop transitions, 310 changer transitions 0/2010 dead transitions. [2025-01-09 16:46:17,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 2010 transitions, 27556 flow [2025-01-09 16:46:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:46:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:46:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2025-01-09 16:46:17,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41626794258373206 [2025-01-09 16:46:17,097 INFO L175 Difference]: Start difference. First operand has 215 places, 654 transitions, 7538 flow. Second operand 19 states and 261 transitions. [2025-01-09 16:46:17,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 2010 transitions, 27556 flow [2025-01-09 16:46:17,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 2010 transitions, 27519 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:17,776 INFO L231 Difference]: Finished difference. Result has 245 places, 886 transitions, 11749 flow [2025-01-09 16:46:17,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7529, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=11749, PETRI_PLACES=245, PETRI_TRANSITIONS=886} [2025-01-09 16:46:17,777 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 210 predicate places. [2025-01-09 16:46:17,777 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 886 transitions, 11749 flow [2025-01-09 16:46:17,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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:46:17,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:17,781 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:46:17,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:17,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:17,982 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:17,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1801254698, now seen corresponding path program 1 times [2025-01-09 16:46:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:17,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771431928] [2025-01-09 16:46:17,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:17,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:17,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:46:17,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:17,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:17,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:18,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771431928] [2025-01-09 16:46:18,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771431928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:18,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756123582] [2025-01-09 16:46:18,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:18,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:18,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:18,077 INFO L229 MonitoredProcess]: Starting monitored process 10 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:46:18,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:46:18,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:46:18,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:18,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:18,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:18,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:46:18,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:18,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756123582] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:18,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:18,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 16:46:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515039712] [2025-01-09 16:46:18,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:46:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:18,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:46:18,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:46:18,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:18,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 886 transitions, 11749 flow. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:18,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:18,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:18,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:19,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_57 .cse0) (< v_~max2~0_58 .cse0)) (and (<= .cse0 v_~max2~0_58) (= v_~max2~0_58 v_~max2~0_57) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_53|, ~max2~0=v_~max2~0_58, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_57, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][337], [1695#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1282#(and (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1294#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 380#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1092#(or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)), Black: 1262#(and (= ~A~0.offset 0) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1290#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1088#(or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0))), Black: 1266#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= ~A~0.offset 0) (or (< 0 thread3Thread1of1ForFork2_~i~2) (= (+ ~max1~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (+ ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 1306#(and (forall ((v_thread3Thread1of1ForFork2_~i~2_31 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_31 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_31 4) ~A~0.offset)) (+ ~max2~0 1)))) (or (= ~max1~0 0) (< 0 ~max2~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 1506#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1322#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1007#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 27#L47true, Black: 1323#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~M~0 thread1Thread1of1ForFork0_~i~0) ~N~0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0)), Black: 1072#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1324#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 1326#(= ~max2~0 ~max1~0), Black: 1052#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1054#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))))), 637#true, Black: 1514#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0)), Black: 1704#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1712#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 871#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1056#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1563#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 1708#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 31#L58-4true, Black: 1512#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1716#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1699#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1697#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1570#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1706#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1701#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1513#(<= ~M~0 0), Black: 61#(<= 1 ~N~0), 1731#true, Black: 775#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 817#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 7#L94-4true, Black: 839#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), 866#true, Black: 829#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))), Black: 853#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max2~0 ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 643#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 825#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= thread1Thread1of1ForFork0_~i~0 0) (<= (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) ~max2~0) (= ~max1~0 0)), Black: 1333#true, Black: 1337#(<= 2 ~N~0), 1317#true, 203#true, Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 422#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 13#L75true, Black: 421#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~M~0 0)), Black: 596#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), 1081#true]) [2025-01-09 16:46:19,961 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2025-01-09 16:46:19,961 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:46:19,961 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:46:19,961 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-01-09 16:46:20,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_57 .cse0) (< v_~max2~0_58 .cse0)) (and (<= .cse0 v_~max2~0_58) (= v_~max2~0_58 v_~max2~0_57) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_53|, ~max2~0=v_~max2~0_58, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_57, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][337], [Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1282#(and (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1294#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 380#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1092#(or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)), Black: 1262#(and (= ~A~0.offset 0) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1290#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1088#(or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0))), Black: 1266#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= ~A~0.offset 0) (or (< 0 thread3Thread1of1ForFork2_~i~2) (= (+ ~max1~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (+ ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 1306#(and (forall ((v_thread3Thread1of1ForFork2_~i~2_31 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_31 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_31 4) ~A~0.offset)) (+ ~max2~0 1)))) (or (= ~max1~0 0) (< 0 ~max2~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 1506#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1322#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1007#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 27#L47true, Black: 1323#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~M~0 thread1Thread1of1ForFork0_~i~0) ~N~0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0)), 4#thread2EXITtrue, Black: 1072#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1324#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 1326#(= ~max2~0 ~max1~0), Black: 1052#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1054#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))))), Black: 1514#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0)), 637#true, Black: 1704#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1712#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 871#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1056#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 1563#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0)), Black: 1708#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1512#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1716#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1695#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1699#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1570#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1706#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1701#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1513#(<= ~M~0 0), Black: 61#(<= 1 ~N~0), 1731#true, Black: 775#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 817#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 7#L94-4true, Black: 839#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), 866#true, Black: 829#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))), Black: 853#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max2~0 ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 643#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 825#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= thread1Thread1of1ForFork0_~i~0 0) (<= (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) ~max2~0) (= ~max1~0 0)), Black: 1333#true, Black: 1337#(<= 2 ~N~0), 1317#true, 203#true, Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), 1697#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 422#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 13#L75true, Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~M~0 0)), Black: 596#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), 1081#true]) [2025-01-09 16:46:20,385 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,385 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_57 .cse0) (< v_~max2~0_58 .cse0)) (and (<= .cse0 v_~max2~0_58) (= v_~max2~0_58 v_~max2~0_57) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_53|, ~max2~0=v_~max2~0_58, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_57, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][337], [1695#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1282#(and (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1294#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 380#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1092#(or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)), Black: 1262#(and (= ~A~0.offset 0) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1290#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1088#(or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0))), Black: 1266#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= ~A~0.offset 0) (or (< 0 thread3Thread1of1ForFork2_~i~2) (= (+ ~max1~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (+ ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 1306#(and (forall ((v_thread3Thread1of1ForFork2_~i~2_31 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_31 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_31 4) ~A~0.offset)) (+ ~max2~0 1)))) (or (= ~max1~0 0) (< 0 ~max2~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 26#L59true, 1506#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1322#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1007#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 27#L47true, Black: 1323#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~M~0 thread1Thread1of1ForFork0_~i~0) ~N~0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0)), Black: 1072#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1324#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 1326#(= ~max2~0 ~max1~0), Black: 1052#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1054#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))))), Black: 1514#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0)), 637#true, Black: 1704#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1712#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 871#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1056#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1563#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 1708#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1512#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1716#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1699#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1697#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1570#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1706#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1701#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1513#(<= ~M~0 0), Black: 61#(<= 1 ~N~0), 1731#true, Black: 775#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 817#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 7#L94-4true, Black: 839#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), 866#true, Black: 829#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))), Black: 853#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max2~0 ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 643#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 825#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= thread1Thread1of1ForFork0_~i~0 0) (<= (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) ~max2~0) (= ~max1~0 0)), Black: 1333#true, Black: 1337#(<= 2 ~N~0), 1317#true, 203#true, Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), Black: 422#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), 414#true, Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 13#L75true, Black: 421#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~M~0 0)), Black: 596#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), 1081#true]) [2025-01-09 16:46:20,387 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,387 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,387 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,387 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_57 .cse0) (< v_~max2~0_58 .cse0)) (and (<= .cse0 v_~max2~0_58) (= v_~max2~0_58 v_~max2~0_57) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_53|, ~max2~0=v_~max2~0_58, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_57, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][337], [1695#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1282#(and (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1294#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 380#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1092#(or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)), Black: 1262#(and (= ~A~0.offset 0) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1290#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1088#(or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0))), Black: 1266#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= ~A~0.offset 0) (or (< 0 thread3Thread1of1ForFork2_~i~2) (= (+ ~max1~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (+ ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 1306#(and (forall ((v_thread3Thread1of1ForFork2_~i~2_31 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_31 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_31 4) ~A~0.offset)) (+ ~max2~0 1)))) (or (= ~max1~0 0) (< 0 ~max2~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 1506#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1322#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1007#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 27#L47true, Black: 1323#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~M~0 thread1Thread1of1ForFork0_~i~0) ~N~0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0)), Black: 1072#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1324#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 1326#(= ~max2~0 ~max1~0), Black: 1052#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1054#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))))), 637#true, Black: 1514#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0)), Black: 1704#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 871#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1712#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1056#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1563#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 1708#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 31#L58-4true, Black: 1512#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1716#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1699#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1697#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1570#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1706#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1701#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1513#(<= ~M~0 0), Black: 61#(<= 1 ~N~0), 1731#true, Black: 775#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 817#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 866#true, Black: 839#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 829#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))), Black: 853#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max2~0 ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 643#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 23#L95true, Black: 825#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= thread1Thread1of1ForFork0_~i~0 0) (<= (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) ~max2~0) (= ~max1~0 0)), Black: 1333#true, Black: 1337#(<= 2 ~N~0), 1317#true, 203#true, Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 414#true, Black: 422#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 13#L75true, Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~M~0 0)), Black: 596#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), 1081#true]) [2025-01-09 16:46:20,388 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,388 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,388 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,388 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-09 16:46:20,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_57 .cse0) (< v_~max2~0_58 .cse0)) (and (<= .cse0 v_~max2~0_58) (= v_~max2~0_58 v_~max2~0_57) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_53|, ~max2~0=v_~max2~0_58, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_57, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][337], [Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1282#(and (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1294#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 380#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1092#(or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)), Black: 1262#(and (= ~A~0.offset 0) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1290#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1088#(or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0))), Black: 1266#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= ~A~0.offset 0) (or (< 0 thread3Thread1of1ForFork2_~i~2) (= (+ ~max1~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (+ ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 1306#(and (forall ((v_thread3Thread1of1ForFork2_~i~2_31 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_31 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_31 4) ~A~0.offset)) (+ ~max2~0 1)))) (or (= ~max1~0 0) (< 0 ~max2~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 1506#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1322#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1007#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1323#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~M~0 thread1Thread1of1ForFork0_~i~0) ~N~0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0)), 27#L47true, 4#thread2EXITtrue, Black: 1072#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1324#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 1052#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1326#(= ~max2~0 ~max1~0), 637#true, Black: 1054#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))))), Black: 1514#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0)), Black: 1704#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1712#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 871#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1056#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 1563#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0)), Black: 1708#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1512#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1716#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1695#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1699#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1570#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1706#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1701#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1513#(<= ~M~0 0), Black: 61#(<= 1 ~N~0), 1731#true, Black: 775#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 817#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 866#true, Black: 839#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 829#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))), Black: 853#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max2~0 ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 643#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 23#L95true, Black: 825#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= thread1Thread1of1ForFork0_~i~0 0) (<= (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) ~max2~0) (= ~max1~0 0)), Black: 1333#true, Black: 1337#(<= 2 ~N~0), 1317#true, 203#true, Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), 1697#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 414#true, Black: 422#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 13#L75true, Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~M~0 0)), Black: 596#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), 1081#true]) [2025-01-09 16:46:20,582 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:46:20,582 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:46:20,582 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:46:20,582 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:46:20,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L71-->L75: Formula: (let ((.cse0 (select (select |v_#memory_int#1_53| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (= v_~max2~0_57 .cse0) (< v_~max2~0_58 .cse0)) (and (<= .cse0 v_~max2~0_58) (= v_~max2~0_58 v_~max2~0_57) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, #memory_int#1=|v_#memory_int#1_53|, ~max2~0=v_~max2~0_58, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, ~max2~0=v_~max2~0_57, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_53|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7][337], [1695#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 408#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 378#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 382#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1282#(and (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1294#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))) (and (<= (+ 2 thread1Thread1of1ForFork0_~i~0) ~N~0) (= (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)) 0)) (and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (= ~max2~0 ~max1~0))) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 347#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 380#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (<= ~N~0 1) (= ~M~0 0)), Black: 1092#(or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)), Black: 1262#(and (= ~A~0.offset 0) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0)) (or (= ~max2~0 0) (< 0 ~max2~0))), Black: 1290#(and (or (= ~max2~0 ~max1~0) (< thread1Thread1of1ForFork0_~i~0 ~N~0)) (or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0)))), Black: 1088#(or (and (<= (+ ~max1~0 1) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (and (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)) (and (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~A~0.offset 0) (<= 2 ~N~0))), Black: 1266#(and (or (= ~max1~0 0) (< 0 ~max2~0)) (= ~A~0.offset 0) (or (< 0 thread3Thread1of1ForFork2_~i~2) (= (+ ~max1~0 (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (+ ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= ~max2~0 ~max1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 1306#(and (forall ((v_thread3Thread1of1ForFork2_~i~2_31 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_31 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_31 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_31 4) ~A~0.offset)) (+ ~max2~0 1)))) (or (= ~max1~0 0) (< 0 ~max2~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 26#L59true, 1506#(and (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0) (<= 2 ~N~0)), Black: 1322#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0)), Black: 48#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1007#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), 27#L47true, Black: 1323#(and (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~M~0 thread1Thread1of1ForFork0_~i~0) ~N~0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0)), Black: 1072#(and (or (and (= ~max2~0 0) (= ~max1~0 0)) (and (<= 1 ~max2~0) (= ~max2~0 ~max1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 1324#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 1326#(= ~max2~0 ~max1~0), Black: 1052#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 1054#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))))), 637#true, Black: 1514#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0)), Black: 1704#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 871#(and (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1712#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1056#(and (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 1563#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0)), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 1708#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1512#(= thread2Thread1of1ForFork1_~i~1 0), Black: 1716#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1699#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1697#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1570#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1706#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1701#(and (<= 1 thread1Thread1of1ForFork0_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1513#(<= ~M~0 0), Black: 61#(<= 1 ~N~0), 1731#true, Black: 775#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 817#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)))), Black: 839#(and (or (and (= ~max2~0 ~max1~0) (<= 1 ~max1~0)) (and (= ~max2~0 0) (= ~max1~0 0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), 866#true, Black: 829#(and (or (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~max2~0 ~max1~0))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (and (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))) (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max2~0 ~max1~0)))) (or (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (+ ~max2~0 1)) (and (or (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1))))) (or (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4)))) (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) (+ ~max1~0 1)))), Black: 853#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~max2~0 ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1)))), Black: 643#(and (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), 23#L95true, Black: 825#(and (= ~A~0.offset 0) (or (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max2~0 0)) (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= thread1Thread1of1ForFork0_~i~0 0) (<= (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) ~max2~0) (= ~max1~0 0)), Black: 1333#true, Black: 1337#(<= 2 ~N~0), 1317#true, 203#true, Black: 418#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 592#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 612#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0) (or (= ~max2~0 0) (< 0 ~max1~0))), Black: 602#(and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), Black: 622#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max2~0) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0) (= ~max2~0 ~max1~0)), 414#true, Black: 422#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= ~max2~0 0) (= ~M~0 0)), Black: 586#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 588#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 417#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~max2~0 0) (= ~max1~0 0)), Black: 552#(and (or (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) (+ ~max1~0 1))) (or (and (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0))) (< ~max1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 13#L75true, Black: 590#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~A~0.offset 0) (= thread2Thread1of1ForFork1_~i~1 0) (= ~max2~0 0) (= ~max1~0 0) (= ~M~0 0)), Black: 421#(and (= ~A~0.offset 0) (or (and (<= 1 (select (select |#memory_int#1| ~A~0.base) 0)) (= ~max1~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (<= (select (select |#memory_int#1| ~A~0.base) 0) 0) (= ~max1~0 0))) (= thread1Thread1of1ForFork0_~i~0 0) (= ~max2~0 0) (= ~M~0 0)), Black: 596#(and (<= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) ~max1~0) (or (< ~max2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~max2~0 ~max1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (+ ~max2~0 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~max1~0)) (<= (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~max1~0)), 1081#true]) [2025-01-09 16:46:20,584 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:46:20,584 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:46:20,584 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:46:20,585 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:46:20,929 INFO L124 PetriNetUnfolderBase]: 8025/12757 cut-off events. [2025-01-09 16:46:20,930 INFO L125 PetriNetUnfolderBase]: For 170563/171355 co-relation queries the response was YES. [2025-01-09 16:46:20,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84955 conditions, 12757 events. 8025/12757 cut-off events. For 170563/171355 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 87353 event pairs, 2708 based on Foata normal form. 810/13435 useless extension candidates. Maximal degree in co-relation 84826. Up to 5756 conditions per place. [2025-01-09 16:46:21,055 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 723 selfloop transitions, 24 changer transitions 0/798 dead transitions. [2025-01-09 16:46:21,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 798 transitions, 12752 flow [2025-01-09 16:46:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:46:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:46:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-01-09 16:46:21,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-01-09 16:46:21,056 INFO L175 Difference]: Start difference. First operand has 245 places, 886 transitions, 11749 flow. Second operand 6 states and 98 transitions. [2025-01-09 16:46:21,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 798 transitions, 12752 flow [2025-01-09 16:46:21,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 798 transitions, 12346 flow, removed 176 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:22,007 INFO L231 Difference]: Finished difference. Result has 231 places, 632 transitions, 8831 flow [2025-01-09 16:46:22,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8686, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8831, PETRI_PLACES=231, PETRI_TRANSITIONS=632} [2025-01-09 16:46:22,008 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 196 predicate places. [2025-01-09 16:46:22,009 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 632 transitions, 8831 flow [2025-01-09 16:46:22,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:22,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:22,009 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 16:46:22,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 16:46:22,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:22,213 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:22,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 197941925, now seen corresponding path program 9 times [2025-01-09 16:46:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129542742] [2025-01-09 16:46:22,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:22,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:22,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:22,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:46:22,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:22,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:22,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129542742] [2025-01-09 16:46:22,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129542742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:22,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:22,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:46:22,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785128625] [2025-01-09 16:46:22,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:22,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:22,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:22,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:46:22,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:46:22,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 632 transitions, 8831 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:46:22,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:22,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:46:22,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:25,245 INFO L124 PetriNetUnfolderBase]: 13603/20200 cut-off events. [2025-01-09 16:46:25,245 INFO L125 PetriNetUnfolderBase]: For 247252/247542 co-relation queries the response was YES. [2025-01-09 16:46:25,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135689 conditions, 20200 events. 13603/20200 cut-off events. For 247252/247542 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 128468 event pairs, 2164 based on Foata normal form. 20/20219 useless extension candidates. Maximal degree in co-relation 131861. Up to 5884 conditions per place. [2025-01-09 16:46:25,403 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 788 selfloop transitions, 181 changer transitions 10/981 dead transitions. [2025-01-09 16:46:25,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 981 transitions, 15264 flow [2025-01-09 16:46:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:46:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:46:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2025-01-09 16:46:25,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2025-01-09 16:46:25,404 INFO L175 Difference]: Start difference. First operand has 231 places, 632 transitions, 8831 flow. Second operand 9 states and 148 transitions. [2025-01-09 16:46:25,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 981 transitions, 15264 flow [2025-01-09 16:46:26,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 981 transitions, 15165 flow, removed 46 selfloop flow, removed 3 redundant places. [2025-01-09 16:46:26,871 INFO L231 Difference]: Finished difference. Result has 240 places, 676 transitions, 10263 flow [2025-01-09 16:46:26,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8808, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10263, PETRI_PLACES=240, PETRI_TRANSITIONS=676} [2025-01-09 16:46:26,872 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 205 predicate places. [2025-01-09 16:46:26,873 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 676 transitions, 10263 flow [2025-01-09 16:46:26,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:46:26,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:26,873 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 16:46:26,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:46:26,873 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:26,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1276763753, now seen corresponding path program 10 times [2025-01-09 16:46:26,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:26,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86269274] [2025-01-09 16:46:26,878 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:26,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:26,886 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-01-09 16:46:26,886 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:46:26,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86269274] [2025-01-09 16:46:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86269274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:46:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776118245] [2025-01-09 16:46:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:26,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:26,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:46:26,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:46:26,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 676 transitions, 10263 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:46:26,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:26,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:46:26,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:30,371 INFO L124 PetriNetUnfolderBase]: 13567/20165 cut-off events. [2025-01-09 16:46:30,372 INFO L125 PetriNetUnfolderBase]: For 267503/267803 co-relation queries the response was YES. [2025-01-09 16:46:30,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139702 conditions, 20165 events. 13567/20165 cut-off events. For 267503/267803 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 127993 event pairs, 2153 based on Foata normal form. 10/20174 useless extension candidates. Maximal degree in co-relation 135657. Up to 7643 conditions per place. [2025-01-09 16:46:30,551 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 641 selfloop transitions, 160 changer transitions 25/828 dead transitions. [2025-01-09 16:46:30,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 828 transitions, 13656 flow [2025-01-09 16:46:30,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:46:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:46:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2025-01-09 16:46:30,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2025-01-09 16:46:30,556 INFO L175 Difference]: Start difference. First operand has 240 places, 676 transitions, 10263 flow. Second operand 8 states and 133 transitions. [2025-01-09 16:46:30,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 828 transitions, 13656 flow [2025-01-09 16:46:33,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 828 transitions, 13540 flow, removed 57 selfloop flow, removed 1 redundant places. [2025-01-09 16:46:33,041 INFO L231 Difference]: Finished difference. Result has 248 places, 673 transitions, 10448 flow [2025-01-09 16:46:33,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10138, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10448, PETRI_PLACES=248, PETRI_TRANSITIONS=673} [2025-01-09 16:46:33,042 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 213 predicate places. [2025-01-09 16:46:33,042 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 673 transitions, 10448 flow [2025-01-09 16:46:33,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:46:33,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:33,043 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 16:46:33,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:46:33,043 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:33,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1020955489, now seen corresponding path program 11 times [2025-01-09 16:46:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672932364] [2025-01-09 16:46:33,044 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:33,048 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:33,051 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:33,051 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:33,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:33,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:33,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672932364] [2025-01-09 16:46:33,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672932364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:33,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831866517] [2025-01-09 16:46:33,088 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:33,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:33,090 INFO L229 MonitoredProcess]: Starting monitored process 11 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:46:33,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 16:46:33,135 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:33,150 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:33,150 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:33,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:33,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:46:33,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:33,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:33,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831866517] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:33,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:33,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-09 16:46:33,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125827978] [2025-01-09 16:46:33,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:33,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:46:33,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:33,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:46:33,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:46:33,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:33,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 673 transitions, 10448 flow. Second operand has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 13 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:46:33,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:33,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:33,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:35,544 INFO L124 PetriNetUnfolderBase]: 9406/14702 cut-off events. [2025-01-09 16:46:35,545 INFO L125 PetriNetUnfolderBase]: For 203094/203689 co-relation queries the response was YES. [2025-01-09 16:46:35,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100378 conditions, 14702 events. 9406/14702 cut-off events. For 203094/203689 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 98513 event pairs, 2975 based on Foata normal form. 563/15256 useless extension candidates. Maximal degree in co-relation 100266. Up to 8563 conditions per place. [2025-01-09 16:46:35,829 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 587 selfloop transitions, 84 changer transitions 8/703 dead transitions. [2025-01-09 16:46:35,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 703 transitions, 12061 flow [2025-01-09 16:46:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:46:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:46:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2025-01-09 16:46:35,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2025-01-09 16:46:35,830 INFO L175 Difference]: Start difference. First operand has 248 places, 673 transitions, 10448 flow. Second operand 7 states and 115 transitions. [2025-01-09 16:46:35,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 703 transitions, 12061 flow [2025-01-09 16:46:37,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 703 transitions, 11718 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:37,014 INFO L231 Difference]: Finished difference. Result has 243 places, 612 transitions, 9362 flow [2025-01-09 16:46:37,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9370, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9362, PETRI_PLACES=243, PETRI_TRANSITIONS=612} [2025-01-09 16:46:37,016 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 208 predicate places. [2025-01-09 16:46:37,016 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 612 transitions, 9362 flow [2025-01-09 16:46:37,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 13 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:46:37,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:37,016 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 16:46:37,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:37,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 16:46:37,220 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:37,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1678128429, now seen corresponding path program 12 times [2025-01-09 16:46:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:37,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918645980] [2025-01-09 16:46:37,221 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:37,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:37,225 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-01-09 16:46:37,228 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 29 statements. [2025-01-09 16:46:37,229 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:46:37,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918645980] [2025-01-09 16:46:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918645980] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302717269] [2025-01-09 16:46:37,273 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:37,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:37,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:37,276 INFO L229 MonitoredProcess]: Starting monitored process 12 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:46:37,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 16:46:37,317 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-01-09 16:46:37,333 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 29 statements. [2025-01-09 16:46:37,333 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:46:37,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:37,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 16:46:37,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:37,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:37,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302717269] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:37,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:46:37,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 19 [2025-01-09 16:46:37,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448385809] [2025-01-09 16:46:37,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:37,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:46:37,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:37,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:46:37,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:46:37,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:46:37,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 612 transitions, 9362 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:46:37,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:37,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:46:37,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:40,178 INFO L124 PetriNetUnfolderBase]: 10915/16401 cut-off events. [2025-01-09 16:46:40,179 INFO L125 PetriNetUnfolderBase]: For 200696/201014 co-relation queries the response was YES. [2025-01-09 16:46:40,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109514 conditions, 16401 events. 10915/16401 cut-off events. For 200696/201014 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 102995 event pairs, 967 based on Foata normal form. 40/16440 useless extension candidates. Maximal degree in co-relation 106766. Up to 5468 conditions per place. [2025-01-09 16:46:40,290 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 751 selfloop transitions, 223 changer transitions 10/986 dead transitions. [2025-01-09 16:46:40,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 986 transitions, 15708 flow [2025-01-09 16:46:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 194 transitions. [2025-01-09 16:46:40,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344352617079889 [2025-01-09 16:46:40,291 INFO L175 Difference]: Start difference. First operand has 243 places, 612 transitions, 9362 flow. Second operand 11 states and 194 transitions. [2025-01-09 16:46:40,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 986 transitions, 15708 flow [2025-01-09 16:46:41,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 986 transitions, 15554 flow, removed 28 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:41,637 INFO L231 Difference]: Finished difference. Result has 254 places, 666 transitions, 10774 flow [2025-01-09 16:46:41,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9216, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10774, PETRI_PLACES=254, PETRI_TRANSITIONS=666} [2025-01-09 16:46:41,638 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 219 predicate places. [2025-01-09 16:46:41,638 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 666 transitions, 10774 flow [2025-01-09 16:46:41,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:46:41,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:41,638 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-01-09 16:46:41,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 16:46:41,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 16:46:41,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:41,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2117261677, now seen corresponding path program 13 times [2025-01-09 16:46:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:41,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930479817] [2025-01-09 16:46:41,843 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:41,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:46:41,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:41,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:41,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:41,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930479817] [2025-01-09 16:46:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930479817] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760277720] [2025-01-09 16:46:41,916 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:41,918 INFO L229 MonitoredProcess]: Starting monitored process 13 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:46:41,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 16:46:41,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:46:41,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:41,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:41,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:41,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:46:41,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:42,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760277720] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:42,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:42,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-09 16:46:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71736735] [2025-01-09 16:46:42,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:42,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:46:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:42,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:46:42,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:46:42,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:42,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 666 transitions, 10774 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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:46:42,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:42,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:42,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:44,067 INFO L124 PetriNetUnfolderBase]: 8113/12639 cut-off events. [2025-01-09 16:46:44,067 INFO L125 PetriNetUnfolderBase]: For 189101/189654 co-relation queries the response was YES. [2025-01-09 16:46:44,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89135 conditions, 12639 events. 8113/12639 cut-off events. For 189101/189654 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 82698 event pairs, 2732 based on Foata normal form. 539/13113 useless extension candidates. Maximal degree in co-relation 87442. Up to 8787 conditions per place. [2025-01-09 16:46:44,209 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 371 selfloop transitions, 3 changer transitions 262/669 dead transitions. [2025-01-09 16:46:44,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 669 transitions, 11852 flow [2025-01-09 16:46:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:46:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:46:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-01-09 16:46:44,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-01-09 16:46:44,210 INFO L175 Difference]: Start difference. First operand has 254 places, 666 transitions, 10774 flow. Second operand 7 states and 110 transitions. [2025-01-09 16:46:44,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 669 transitions, 11852 flow [2025-01-09 16:46:45,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 669 transitions, 11600 flow, removed 88 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:45,468 INFO L231 Difference]: Finished difference. Result has 256 places, 407 transitions, 6029 flow [2025-01-09 16:46:45,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9720, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=614, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6029, PETRI_PLACES=256, PETRI_TRANSITIONS=407} [2025-01-09 16:46:45,469 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 221 predicate places. [2025-01-09 16:46:45,469 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 407 transitions, 6029 flow [2025-01-09 16:46:45,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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:46:45,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:45,469 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] [2025-01-09 16:46:45,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:45,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 16:46:45,673 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:45,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 434579387, now seen corresponding path program 14 times [2025-01-09 16:46:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271115026] [2025-01-09 16:46:45,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:45,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:46:45,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:46:45,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:45,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:45,902 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:46:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271115026] [2025-01-09 16:46:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271115026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362680085] [2025-01-09 16:46:45,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:45,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:45,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:45,904 INFO L229 MonitoredProcess]: Starting monitored process 14 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:46:45,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 16:46:45,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:46:45,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:46:45,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:45,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:45,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:46:45,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:46,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362680085] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:46,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-01-09 16:46:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633086880] [2025-01-09 16:46:46,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:46,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:46:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:46,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:46:46,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:46:46,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:46:46,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 407 transitions, 6029 flow. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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:46:46,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:46,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:46:46,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:51,425 INFO L124 PetriNetUnfolderBase]: 23506/33568 cut-off events. [2025-01-09 16:46:51,426 INFO L125 PetriNetUnfolderBase]: For 521138/522571 co-relation queries the response was YES. [2025-01-09 16:46:51,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243049 conditions, 33568 events. 23506/33568 cut-off events. For 521138/522571 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 208806 event pairs, 945 based on Foata normal form. 1184/34715 useless extension candidates. Maximal degree in co-relation 242973. Up to 14317 conditions per place. [2025-01-09 16:46:51,952 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 1095 selfloop transitions, 332 changer transitions 0/1459 dead transitions. [2025-01-09 16:46:51,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 1459 transitions, 24417 flow [2025-01-09 16:46:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 16:46:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-01-09 16:46:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 573 transitions. [2025-01-09 16:46:51,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4692874692874693 [2025-01-09 16:46:51,958 INFO L175 Difference]: Start difference. First operand has 256 places, 407 transitions, 6029 flow. Second operand 37 states and 573 transitions. [2025-01-09 16:46:51,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 1459 transitions, 24417 flow [2025-01-09 16:46:54,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 1459 transitions, 22425 flow, removed 455 selfloop flow, removed 23 redundant places. [2025-01-09 16:46:54,407 INFO L231 Difference]: Finished difference. Result has 236 places, 640 transitions, 9284 flow [2025-01-09 16:46:54,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5410, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=9284, PETRI_PLACES=236, PETRI_TRANSITIONS=640} [2025-01-09 16:46:54,408 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 201 predicate places. [2025-01-09 16:46:54,408 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 640 transitions, 9284 flow [2025-01-09 16:46:54,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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:46:54,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:54,408 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] [2025-01-09 16:46:54,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:54,613 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash 609244813, now seen corresponding path program 15 times [2025-01-09 16:46:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956141546] [2025-01-09 16:46:54,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:54,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:46:54,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:46:54,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:46:54,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:54,690 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:46:54,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:54,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956141546] [2025-01-09 16:46:54,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956141546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:54,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684702708] [2025-01-09 16:46:54,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:54,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:54,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:54,693 INFO L229 MonitoredProcess]: Starting monitored process 15 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:46:54,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 16:46:54,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:46:54,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:46:54,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:46:54,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:54,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:46:54,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:54,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684702708] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:54,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-01-09 16:46:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205100918] [2025-01-09 16:46:54,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:54,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:46:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:54,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:46:54,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:46:54,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:46:54,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 640 transitions, 9284 flow. Second operand has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:54,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:54,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:46:54,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:00,024 INFO L124 PetriNetUnfolderBase]: 23844/34152 cut-off events. [2025-01-09 16:47:00,024 INFO L125 PetriNetUnfolderBase]: For 579850/581360 co-relation queries the response was YES. [2025-01-09 16:47:00,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263676 conditions, 34152 events. 23844/34152 cut-off events. For 579850/581360 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 215323 event pairs, 2153 based on Foata normal form. 1274/35396 useless extension candidates. Maximal degree in co-relation 263598. Up to 14715 conditions per place. [2025-01-09 16:47:00,523 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 645 selfloop transitions, 271 changer transitions 0/948 dead transitions. [2025-01-09 16:47:00,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 948 transitions, 15434 flow [2025-01-09 16:47:00,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:47:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:47:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2025-01-09 16:47:00,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125874125874126 [2025-01-09 16:47:00,524 INFO L175 Difference]: Start difference. First operand has 236 places, 640 transitions, 9284 flow. Second operand 13 states and 177 transitions. [2025-01-09 16:47:00,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 948 transitions, 15434 flow