/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:30:46,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:30:46,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:30:46,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:30:46,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:30:46,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:30:46,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:30:46,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:30:46,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:30:46,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:30:46,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:30:46,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:30:46,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:30:46,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:30:46,393 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:30:46,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:30:46,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:30:46,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:30:46,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:30:46,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:30:46,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:30:46,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:30:46,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:30:46,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:30:46,396 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:30:46,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:30:46,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:30:46,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:30:46,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:30:46,597 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:30:46,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2025-04-13 20:30:47,843 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed1096cf/c4bf9383f82b41419454b1a41bb96a18/FLAG91b45de7c [2025-04-13 20:30:48,005 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:30:48,005 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2025-04-13 20:30:48,011 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed1096cf/c4bf9383f82b41419454b1a41bb96a18/FLAG91b45de7c [2025-04-13 20:30:48,844 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed1096cf/c4bf9383f82b41419454b1a41bb96a18 [2025-04-13 20:30:48,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:30:48,847 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:30:48,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:30:48,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:30:48,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:30:48,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:30:48" (1/1) ... [2025-04-13 20:30:48,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0e8de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:48, skipping insertion in model container [2025-04-13 20:30:48,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:30:48" (1/1) ... [2025-04-13 20:30:48,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:30:49,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-04-13 20:30:49,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:30:49,057 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:30:49,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-04-13 20:30:49,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:30:49,110 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:30:49,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49 WrapperNode [2025-04-13 20:30:49,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:30:49,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:30:49,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:30:49,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:30:49,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,157 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-04-13 20:30:49,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:30:49,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:30:49,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:30:49,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:30:49,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,197 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 20:30:49,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:30:49,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:30:49,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:30:49,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:30:49,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (1/1) ... [2025-04-13 20:30:49,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:30:49,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:49,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:30:49,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:30:49,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:30:49,259 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:30:49,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:30:49,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:30:49,260 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:30:49,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:30:49,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:30:49,261 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:30:49,332 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:30:49,334 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:30:49,676 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:30:49,676 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:30:49,676 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:30:49,993 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:30:49,996 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:30:50,001 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:30:50,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:30:50 BoogieIcfgContainer [2025-04-13 20:30:50,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:30:50,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:30:50,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:30:50,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:30:50,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:30:48" (1/3) ... [2025-04-13 20:30:50,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206f9ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:30:50, skipping insertion in model container [2025-04-13 20:30:50,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:49" (2/3) ... [2025-04-13 20:30:50,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206f9ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:30:50, skipping insertion in model container [2025-04-13 20:30:50,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:30:50" (3/3) ... [2025-04-13 20:30:50,008 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-04-13 20:30:50,019 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:30:50,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 20:30:50,020 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:30:50,071 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:30:50,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:30:50,126 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-13 20:30:50,127 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:30:50,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-04-13 20:30:50,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:30:50,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-13 20:30:50,143 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:30:50,155 INFO L340 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;@1827096, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:30:50,156 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:30:50,186 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:30:50,186 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-13 20:30:50,186 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:30:50,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:50,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:50,191 INFO L403 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-04-13 20:30:50,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1762119884, now seen corresponding path program 1 times [2025-04-13 20:30:50,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:50,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918398942] [2025-04-13 20:30:50,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:50,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:30:50,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:30:50,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:50,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:50,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918398942] [2025-04-13 20:30:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918398942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:50,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:50,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:30:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110451706] [2025-04-13 20:30:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:50,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:30:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:50,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:30:50,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:30:50,473 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:30:50,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04-13 20:30:50,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:50,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:30:50,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:50,597 INFO L116 PetriNetUnfolderBase]: 228/344 cut-off events. [2025-04-13 20:30:50,597 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-13 20:30:50,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 344 events. 228/344 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 915 event pairs, 124 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 603. Up to 319 conditions per place. [2025-04-13 20:30:50,601 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 24 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-13 20:30:50,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 122 flow [2025-04-13 20:30:50,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:30:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:30:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 20:30:50,608 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-13 20:30:50,609 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 41 transitions. [2025-04-13 20:30:50,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 122 flow [2025-04-13 20:30:50,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:30:50,614 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 62 flow [2025-04-13 20:30:50,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-13 20:30:50,618 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-13 20:30:50,618 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 62 flow [2025-04-13 20:30:50,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04-13 20:30:50,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:50,619 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-04-13 20:30:50,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:30:50,619 INFO L403 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-04-13 20:30:50,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1906498476, now seen corresponding path program 1 times [2025-04-13 20:30:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:50,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34564619] [2025-04-13 20:30:50,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:50,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:50,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:30:50,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:30:50,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:50,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:50,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34564619] [2025-04-13 20:30:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34564619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:50,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:30:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021658308] [2025-04-13 20:30:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:50,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:30:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:50,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:30:50,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:30:50,854 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:30:50,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-04-13 20:30:50,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:50,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:30:50,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:50,987 INFO L116 PetriNetUnfolderBase]: 228/347 cut-off events. [2025-04-13 20:30:50,988 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 20:30:50,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 347 events. 228/347 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 916 event pairs, 124 based on Foata normal form. 3/243 useless extension candidates. Maximal degree in co-relation 670. Up to 324 conditions per place. [2025-04-13 20:30:50,991 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 4 changer transitions 1/30 dead transitions. [2025-04-13 20:30:50,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 30 transitions, 124 flow [2025-04-13 20:30:50,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:30:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:30:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-13 20:30:50,993 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2025-04-13 20:30:50,994 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 62 flow. Second operand 4 states and 51 transitions. [2025-04-13 20:30:50,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 30 transitions, 124 flow [2025-04-13 20:30:50,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:50,995 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 87 flow [2025-04-13 20:30:50,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-04-13 20:30:50,996 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2025-04-13 20:30:50,996 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 87 flow [2025-04-13 20:30:50,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-04-13 20:30:50,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:50,997 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] [2025-04-13 20:30:50,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:30:50,998 INFO L403 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-04-13 20:30:50,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1626836474, now seen corresponding path program 1 times [2025-04-13 20:30:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:50,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837367673] [2025-04-13 20:30:50,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:51,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:30:51,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:30:51,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:51,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:51,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837367673] [2025-04-13 20:30:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837367673] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:51,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059058623] [2025-04-13 20:30:51,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:51,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:51,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:51,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:30:51,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:30:51,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:30:51,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:51,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:51,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:30:51,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:51,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059058623] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:51,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:30:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-13 20:30:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199024490] [2025-04-13 20:30:51,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:51,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:30:51,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:51,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:30:51,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:30:51,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:30:51,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-04-13 20:30:51,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:51,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:30:51,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:51,488 INFO L116 PetriNetUnfolderBase]: 295/439 cut-off events. [2025-04-13 20:30:51,488 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:30:51,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 439 events. 295/439 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1306 event pairs, 108 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 869. Up to 324 conditions per place. [2025-04-13 20:30:51,493 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 36 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-04-13 20:30:51,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 42 transitions, 195 flow [2025-04-13 20:30:51,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:30:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:30:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-04-13 20:30:51,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-13 20:30:51,494 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 87 flow. Second operand 5 states and 65 transitions. [2025-04-13 20:30:51,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 42 transitions, 195 flow [2025-04-13 20:30:51,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 187 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:30:51,495 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 95 flow [2025-04-13 20:30:51,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-04-13 20:30:51,496 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-04-13 20:30:51,496 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 95 flow [2025-04-13 20:30:51,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-04-13 20:30:51,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:51,496 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-04-13 20:30:51,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:30:51,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:51,697 INFO L403 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-04-13 20:30:51,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 870354305, now seen corresponding path program 1 times [2025-04-13 20:30:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:51,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962757406] [2025-04-13 20:30:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:51,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:30:51,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:30:51,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:52,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:52,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962757406] [2025-04-13 20:30:52,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962757406] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:52,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3237707] [2025-04-13 20:30:52,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:52,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:52,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:30:52,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:30:52,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:30:52,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:52,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:52,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:30:52,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:52,891 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:30:52,917 INFO L354 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-04-13 20:30:52,951 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:30:52,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:30:52,977 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:30:53,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:30:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:53,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3237707] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:53,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:53,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 26 [2025-04-13 20:30:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069984802] [2025-04-13 20:30:53,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:53,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 20:30:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:53,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 20:30:53,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-04-13 20:30:53,387 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:53,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 95 flow. Second operand has 28 states, 28 states have (on average 5.0) internal successors, (140), 28 states have internal predecessors, (140), 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-04-13 20:30:53,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:53,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:53,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:54,101 INFO L116 PetriNetUnfolderBase]: 680/984 cut-off events. [2025-04-13 20:30:54,101 INFO L117 PetriNetUnfolderBase]: For 334/334 co-relation queries the response was YES. [2025-04-13 20:30:54,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2356 conditions, 984 events. 680/984 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3467 event pairs, 89 based on Foata normal form. 1/775 useless extension candidates. Maximal degree in co-relation 2327. Up to 718 conditions per place. [2025-04-13 20:30:54,108 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 58 selfloop transitions, 35 changer transitions 1/94 dead transitions. [2025-04-13 20:30:54,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 94 transitions, 472 flow [2025-04-13 20:30:54,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:30:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:30:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2025-04-13 20:30:54,110 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3013392857142857 [2025-04-13 20:30:54,111 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 95 flow. Second operand 14 states and 135 transitions. [2025-04-13 20:30:54,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 94 transitions, 472 flow [2025-04-13 20:30:54,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 94 transitions, 431 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-04-13 20:30:54,114 INFO L231 Difference]: Finished difference. Result has 51 places, 60 transitions, 300 flow [2025-04-13 20:30:54,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=300, PETRI_PLACES=51, PETRI_TRANSITIONS=60} [2025-04-13 20:30:54,117 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2025-04-13 20:30:54,117 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 300 flow [2025-04-13 20:30:54,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.0) internal successors, (140), 28 states have internal predecessors, (140), 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-04-13 20:30:54,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:54,117 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-04-13 20:30:54,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:30:54,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 20:30:54,318 INFO L403 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-04-13 20:30:54,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1261531153, now seen corresponding path program 2 times [2025-04-13 20:30:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:54,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697195946] [2025-04-13 20:30:54,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:30:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:54,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:30:54,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:30:54,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:30:54,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:55,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:55,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697195946] [2025-04-13 20:30:55,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697195946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:55,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429721511] [2025-04-13 20:30:55,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:30:55,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:55,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:55,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:55,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:30:55,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:30:55,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:30:55,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:30:55,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:55,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:30:55,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:55,297 INFO L325 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-04-13 20:30:55,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2025-04-13 20:30:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:55,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:55,391 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:30:55,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2025-04-13 20:30:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:55,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429721511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:55,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:55,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 16 [2025-04-13 20:30:55,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916669934] [2025-04-13 20:30:55,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:55,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:30:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:55,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:30:55,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:30:55,588 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:55,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 300 flow. Second operand has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:55,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:55,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:55,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:56,911 INFO L116 PetriNetUnfolderBase]: 2283/3243 cut-off events. [2025-04-13 20:30:56,912 INFO L117 PetriNetUnfolderBase]: For 2718/2718 co-relation queries the response was YES. [2025-04-13 20:30:56,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10018 conditions, 3243 events. 2283/3243 cut-off events. For 2718/2718 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14458 event pairs, 92 based on Foata normal form. 1/2782 useless extension candidates. Maximal degree in co-relation 9979. Up to 1323 conditions per place. [2025-04-13 20:30:56,930 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 162 selfloop transitions, 158 changer transitions 1/321 dead transitions. [2025-04-13 20:30:56,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 321 transitions, 2022 flow [2025-04-13 20:30:56,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 20:30:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 20:30:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 359 transitions. [2025-04-13 20:30:56,934 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37395833333333334 [2025-04-13 20:30:56,934 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 300 flow. Second operand 30 states and 359 transitions. [2025-04-13 20:30:56,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 321 transitions, 2022 flow [2025-04-13 20:30:56,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 321 transitions, 2018 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:56,956 INFO L231 Difference]: Finished difference. Result has 92 places, 215 transitions, 1657 flow [2025-04-13 20:30:56,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1657, PETRI_PLACES=92, PETRI_TRANSITIONS=215} [2025-04-13 20:30:56,956 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 61 predicate places. [2025-04-13 20:30:56,956 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 215 transitions, 1657 flow [2025-04-13 20:30:56,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.444444444444445) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:56,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:56,957 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-04-13 20:30:56,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:30:57,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:57,157 INFO L403 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-04-13 20:30:57,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1286749517, now seen corresponding path program 3 times [2025-04-13 20:30:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:57,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372816474] [2025-04-13 20:30:57,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:30:57,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:57,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:30:57,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:30:57,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:30:57,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:57,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372816474] [2025-04-13 20:30:57,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372816474] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:57,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125458196] [2025-04-13 20:30:57,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:30:57,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:57,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:57,786 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:57,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:30:57,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:30:57,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:30:57,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:30:57,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:57,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:30:57,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:58,012 INFO L325 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-04-13 20:30:58,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2025-04-13 20:30:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:58,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:58,115 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:30:58,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:30:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:30:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125458196] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:30:58,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:30:58,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 17 [2025-04-13 20:30:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485826081] [2025-04-13 20:30:58,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:30:58,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:30:58,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:58,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:30:58,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:30:58,246 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:58,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 215 transitions, 1657 flow. Second operand has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:58,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:58,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:58,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:59,760 INFO L116 PetriNetUnfolderBase]: 3735/5239 cut-off events. [2025-04-13 20:30:59,762 INFO L117 PetriNetUnfolderBase]: For 22137/22137 co-relation queries the response was YES. [2025-04-13 20:30:59,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24355 conditions, 5239 events. 3735/5239 cut-off events. For 22137/22137 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 24491 event pairs, 225 based on Foata normal form. 1/4375 useless extension candidates. Maximal degree in co-relation 24299. Up to 2176 conditions per place. [2025-04-13 20:30:59,798 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 199 selfloop transitions, 278 changer transitions 1/478 dead transitions. [2025-04-13 20:30:59,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 478 transitions, 4417 flow [2025-04-13 20:30:59,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:30:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:30:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 348 transitions. [2025-04-13 20:30:59,800 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2025-04-13 20:30:59,800 INFO L175 Difference]: Start difference. First operand has 92 places, 215 transitions, 1657 flow. Second operand 28 states and 348 transitions. [2025-04-13 20:30:59,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 478 transitions, 4417 flow [2025-04-13 20:30:59,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 478 transitions, 3899 flow, removed 202 selfloop flow, removed 4 redundant places. [2025-04-13 20:30:59,921 INFO L231 Difference]: Finished difference. Result has 128 places, 364 transitions, 3310 flow [2025-04-13 20:30:59,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3310, PETRI_PLACES=128, PETRI_TRANSITIONS=364} [2025-04-13 20:30:59,922 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 97 predicate places. [2025-04-13 20:30:59,922 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 364 transitions, 3310 flow [2025-04-13 20:30:59,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:59,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:59,922 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-04-13 20:30:59,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:00,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:00,123 INFO L403 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-04-13 20:31:00,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash -54434355, now seen corresponding path program 4 times [2025-04-13 20:31:00,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:00,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724943150] [2025-04-13 20:31:00,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:31:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:00,130 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:00,140 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:00,140 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:31:00,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:00,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724943150] [2025-04-13 20:31:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724943150] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:00,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757621917] [2025-04-13 20:31:00,593 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:31:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:00,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:00,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:31:00,641 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:00,664 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:00,665 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:31:00,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:00,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:31:00,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:00,675 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:31:00,691 INFO L354 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-04-13 20:31:00,712 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:31:00,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:31:00,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:31:00,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:31:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:00,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757621917] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:01,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 23 [2025-04-13 20:31:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845169331] [2025-04-13 20:31:01,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:01,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:31:01,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:01,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:31:01,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:31:01,037 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:01,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 364 transitions, 3310 flow. Second operand has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 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-04-13 20:31:01,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:01,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:01,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:03,349 INFO L116 PetriNetUnfolderBase]: 7592/10623 cut-off events. [2025-04-13 20:31:03,350 INFO L117 PetriNetUnfolderBase]: For 68649/68649 co-relation queries the response was YES. [2025-04-13 20:31:03,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56862 conditions, 10623 events. 7592/10623 cut-off events. For 68649/68649 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 55816 event pairs, 502 based on Foata normal form. 10/8924 useless extension candidates. Maximal degree in co-relation 56615. Up to 6442 conditions per place. [2025-04-13 20:31:03,416 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 485 selfloop transitions, 583 changer transitions 2/1070 dead transitions. [2025-04-13 20:31:03,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1070 transitions, 11660 flow [2025-04-13 20:31:03,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 20:31:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-13 20:31:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 507 transitions. [2025-04-13 20:31:03,419 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35208333333333336 [2025-04-13 20:31:03,420 INFO L175 Difference]: Start difference. First operand has 128 places, 364 transitions, 3310 flow. Second operand 45 states and 507 transitions. [2025-04-13 20:31:03,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1070 transitions, 11660 flow [2025-04-13 20:31:04,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 1070 transitions, 11385 flow, removed 132 selfloop flow, removed 2 redundant places. [2025-04-13 20:31:04,062 INFO L231 Difference]: Finished difference. Result has 191 places, 872 transitions, 10257 flow [2025-04-13 20:31:04,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3172, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=10257, PETRI_PLACES=191, PETRI_TRANSITIONS=872} [2025-04-13 20:31:04,062 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2025-04-13 20:31:04,063 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 872 transitions, 10257 flow [2025-04-13 20:31:04,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 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-04-13 20:31:04,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:04,063 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-04-13 20:31:04,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:04,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:04,264 INFO L403 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-04-13 20:31:04,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:04,264 INFO L85 PathProgramCache]: Analyzing trace with hash -490875065, now seen corresponding path program 5 times [2025-04-13 20:31:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:04,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563115578] [2025-04-13 20:31:04,264 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:04,272 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:04,291 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:04,292 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:04,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:04,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563115578] [2025-04-13 20:31:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563115578] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:04,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439111414] [2025-04-13 20:31:04,759 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:04,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:04,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:04,760 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:04,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:31:04,811 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:04,832 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:04,833 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:04,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:04,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:31:04,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:04,881 INFO L354 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-04-13 20:31:04,990 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:04,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-04-13 20:31:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:04,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:05,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439111414] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:05,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:05,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 19 [2025-04-13 20:31:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739994011] [2025-04-13 20:31:05,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:05,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:31:05,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:05,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:31:05,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:31:05,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:05,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 872 transitions, 10257 flow. Second operand has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 21 states have internal predecessors, (113), 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-04-13 20:31:05,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:05,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:05,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:06,818 INFO L116 PetriNetUnfolderBase]: 7673/10759 cut-off events. [2025-04-13 20:31:06,818 INFO L117 PetriNetUnfolderBase]: For 93705/93705 co-relation queries the response was YES. [2025-04-13 20:31:06,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66601 conditions, 10759 events. 7673/10759 cut-off events. For 93705/93705 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 56983 event pairs, 1340 based on Foata normal form. 1/9091 useless extension candidates. Maximal degree in co-relation 66323. Up to 9989 conditions per place. [2025-04-13 20:31:06,896 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 735 selfloop transitions, 214 changer transitions 1/950 dead transitions. [2025-04-13 20:31:06,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 950 transitions, 12864 flow [2025-04-13 20:31:06,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:31:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:31:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2025-04-13 20:31:06,898 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3245192307692308 [2025-04-13 20:31:06,898 INFO L175 Difference]: Start difference. First operand has 191 places, 872 transitions, 10257 flow. Second operand 13 states and 135 transitions. [2025-04-13 20:31:06,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 950 transitions, 12864 flow [2025-04-13 20:31:07,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 950 transitions, 12163 flow, removed 345 selfloop flow, removed 2 redundant places. [2025-04-13 20:31:07,881 INFO L231 Difference]: Finished difference. Result has 207 places, 902 transitions, 10451 flow [2025-04-13 20:31:07,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9568, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10451, PETRI_PLACES=207, PETRI_TRANSITIONS=902} [2025-04-13 20:31:07,882 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2025-04-13 20:31:07,882 INFO L485 AbstractCegarLoop]: Abstraction has has 207 places, 902 transitions, 10451 flow [2025-04-13 20:31:07,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 21 states have internal predecessors, (113), 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-04-13 20:31:07,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:07,882 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-04-13 20:31:07,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:31:08,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:08,084 INFO L403 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-04-13 20:31:08,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash 94389041, now seen corresponding path program 6 times [2025-04-13 20:31:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:08,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441187119] [2025-04-13 20:31:08,085 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:08,090 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:08,111 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:08,112 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:31:08,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:08,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:08,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441187119] [2025-04-13 20:31:08,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441187119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:08,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940009835] [2025-04-13 20:31:08,435 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:08,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:08,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:08,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:08,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:31:08,483 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:08,503 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:08,504 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:31:08,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:08,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:08,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:08,644 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:08,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:31:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:08,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:08,732 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:08,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2025-04-13 20:31:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940009835] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:08,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:08,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-13 20:31:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029388871] [2025-04-13 20:31:08,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:08,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:31:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:08,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:31:08,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:31:08,913 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:08,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 902 transitions, 10451 flow. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 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-04-13 20:31:08,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:08,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:08,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:11,172 INFO L116 PetriNetUnfolderBase]: 7805/10955 cut-off events. [2025-04-13 20:31:11,172 INFO L117 PetriNetUnfolderBase]: For 80687/80687 co-relation queries the response was YES. [2025-04-13 20:31:11,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65244 conditions, 10955 events. 7805/10955 cut-off events. For 80687/80687 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 58143 event pairs, 885 based on Foata normal form. 2/9248 useless extension candidates. Maximal degree in co-relation 64959. Up to 9001 conditions per place. [2025-04-13 20:31:11,249 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 615 selfloop transitions, 398 changer transitions 2/1015 dead transitions. [2025-04-13 20:31:11,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1015 transitions, 13418 flow [2025-04-13 20:31:11,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 20:31:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-13 20:31:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 228 transitions. [2025-04-13 20:31:11,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2025-04-13 20:31:11,250 INFO L175 Difference]: Start difference. First operand has 207 places, 902 transitions, 10451 flow. Second operand 21 states and 228 transitions. [2025-04-13 20:31:11,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1015 transitions, 13418 flow [2025-04-13 20:31:11,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 1015 transitions, 13206 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-04-13 20:31:11,880 INFO L231 Difference]: Finished difference. Result has 228 places, 945 transitions, 11766 flow [2025-04-13 20:31:11,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=10241, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=11766, PETRI_PLACES=228, PETRI_TRANSITIONS=945} [2025-04-13 20:31:11,881 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 197 predicate places. [2025-04-13 20:31:11,881 INFO L485 AbstractCegarLoop]: Abstraction has has 228 places, 945 transitions, 11766 flow [2025-04-13 20:31:11,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 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-04-13 20:31:11,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:11,881 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-04-13 20:31:11,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:12,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:12,083 INFO L403 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-04-13 20:31:12,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1619043771, now seen corresponding path program 7 times [2025-04-13 20:31:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:12,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109107364] [2025-04-13 20:31:12,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:12,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:12,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:31:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:12,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:12,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:12,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109107364] [2025-04-13 20:31:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109107364] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:12,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877227030] [2025-04-13 20:31:12,388 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:12,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:12,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:12,390 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:12,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:31:12,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:31:12,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:12,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:12,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:12,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:31:12,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:12,470 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:31:12,489 INFO L354 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-04-13 20:31:12,508 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:31:12,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:31:12,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:31:12,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:31:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:12,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:12,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877227030] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:12,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:12,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 22 [2025-04-13 20:31:12,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345917934] [2025-04-13 20:31:12,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:12,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:31:12,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:12,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:31:12,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:31:12,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:12,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 945 transitions, 11766 flow. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 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-04-13 20:31:12,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:12,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:12,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:14,703 INFO L116 PetriNetUnfolderBase]: 7859/11046 cut-off events. [2025-04-13 20:31:14,703 INFO L117 PetriNetUnfolderBase]: For 83500/83500 co-relation queries the response was YES. [2025-04-13 20:31:14,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68986 conditions, 11046 events. 7859/11046 cut-off events. For 83500/83500 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 59172 event pairs, 1325 based on Foata normal form. 1/9326 useless extension candidates. Maximal degree in co-relation 68691. Up to 10276 conditions per place. [2025-04-13 20:31:14,787 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 754 selfloop transitions, 245 changer transitions 1/1000 dead transitions. [2025-04-13 20:31:14,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1000 transitions, 14147 flow [2025-04-13 20:31:14,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:31:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:31:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 159 transitions. [2025-04-13 20:31:14,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33125 [2025-04-13 20:31:14,791 INFO L175 Difference]: Start difference. First operand has 228 places, 945 transitions, 11766 flow. Second operand 15 states and 159 transitions. [2025-04-13 20:31:14,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 1000 transitions, 14147 flow [2025-04-13 20:31:15,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 1000 transitions, 13841 flow, removed 41 selfloop flow, removed 7 redundant places. [2025-04-13 20:31:15,553 INFO L231 Difference]: Finished difference. Result has 239 places, 958 transitions, 12240 flow [2025-04-13 20:31:15,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11460, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12240, PETRI_PLACES=239, PETRI_TRANSITIONS=958} [2025-04-13 20:31:15,554 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2025-04-13 20:31:15,554 INFO L485 AbstractCegarLoop]: Abstraction has has 239 places, 958 transitions, 12240 flow [2025-04-13 20:31:15,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 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-04-13 20:31:15,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:15,554 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-04-13 20:31:15,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 20:31:15,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 20:31:15,755 INFO L403 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-04-13 20:31:15,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -718594951, now seen corresponding path program 8 times [2025-04-13 20:31:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:15,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709936174] [2025-04-13 20:31:15,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:15,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:15,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:15,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:15,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:16,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:16,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709936174] [2025-04-13 20:31:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709936174] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:16,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104217478] [2025-04-13 20:31:16,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:16,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:16,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:16,118 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:16,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:31:16,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:16,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:16,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:16,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:16,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:16,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:16,450 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:16,450 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:31:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:16,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:16,517 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:16,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2025-04-13 20:31:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104217478] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:16,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:16,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 18 [2025-04-13 20:31:16,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779437332] [2025-04-13 20:31:16,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:16,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:31:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:16,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:31:16,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:31:16,644 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:16,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 958 transitions, 12240 flow. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:16,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:16,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:16,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:18,606 INFO L116 PetriNetUnfolderBase]: 7873/11077 cut-off events. [2025-04-13 20:31:18,607 INFO L117 PetriNetUnfolderBase]: For 85632/85632 co-relation queries the response was YES. [2025-04-13 20:31:18,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70157 conditions, 11077 events. 7873/11077 cut-off events. For 85632/85632 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 59514 event pairs, 1351 based on Foata normal form. 1/9339 useless extension candidates. Maximal degree in co-relation 69913. Up to 10331 conditions per place. [2025-04-13 20:31:18,725 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 758 selfloop transitions, 238 changer transitions 1/997 dead transitions. [2025-04-13 20:31:18,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 997 transitions, 14435 flow [2025-04-13 20:31:18,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:31:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:31:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 146 transitions. [2025-04-13 20:31:18,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32589285714285715 [2025-04-13 20:31:18,727 INFO L175 Difference]: Start difference. First operand has 239 places, 958 transitions, 12240 flow. Second operand 14 states and 146 transitions. [2025-04-13 20:31:18,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 997 transitions, 14435 flow [2025-04-13 20:31:19,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 997 transitions, 14165 flow, removed 38 selfloop flow, removed 8 redundant places. [2025-04-13 20:31:19,690 INFO L231 Difference]: Finished difference. Result has 246 places, 962 transitions, 12501 flow [2025-04-13 20:31:19,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11970, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12501, PETRI_PLACES=246, PETRI_TRANSITIONS=962} [2025-04-13 20:31:19,691 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 215 predicate places. [2025-04-13 20:31:19,691 INFO L485 AbstractCegarLoop]: Abstraction has has 246 places, 962 transitions, 12501 flow [2025-04-13 20:31:19,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:19,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:19,691 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-04-13 20:31:19,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:31:19,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:19,892 INFO L403 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-04-13 20:31:19,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1332478787, now seen corresponding path program 9 times [2025-04-13 20:31:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:19,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888751556] [2025-04-13 20:31:19,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:19,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:19,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:19,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:19,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:31:19,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:20,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:20,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888751556] [2025-04-13 20:31:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888751556] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:20,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325998022] [2025-04-13 20:31:20,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:20,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:20,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:20,230 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:20,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:31:20,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:20,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:20,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:31:20,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:20,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:20,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:20,415 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:20,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:31:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:20,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:20,491 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:20,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2025-04-13 20:31:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325998022] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:20,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-13 20:31:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415832201] [2025-04-13 20:31:20,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:20,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:31:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:20,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:31:20,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:31:20,647 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:20,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 962 transitions, 12501 flow. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 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-04-13 20:31:20,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:20,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:20,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:23,367 INFO L116 PetriNetUnfolderBase]: 9092/12858 cut-off events. [2025-04-13 20:31:23,367 INFO L117 PetriNetUnfolderBase]: For 105489/105489 co-relation queries the response was YES. [2025-04-13 20:31:23,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82398 conditions, 12858 events. 9092/12858 cut-off events. For 105489/105489 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 71209 event pairs, 883 based on Foata normal form. 1/10870 useless extension candidates. Maximal degree in co-relation 82125. Up to 8801 conditions per place. [2025-04-13 20:31:23,470 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 530 selfloop transitions, 701 changer transitions 1/1232 dead transitions. [2025-04-13 20:31:23,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1232 transitions, 17890 flow [2025-04-13 20:31:23,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 20:31:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-13 20:31:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 311 transitions. [2025-04-13 20:31:23,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33512931034482757 [2025-04-13 20:31:23,472 INFO L175 Difference]: Start difference. First operand has 246 places, 962 transitions, 12501 flow. Second operand 29 states and 311 transitions. [2025-04-13 20:31:23,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 1232 transitions, 17890 flow [2025-04-13 20:31:24,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1232 transitions, 17589 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-04-13 20:31:24,357 INFO L231 Difference]: Finished difference. Result has 271 places, 1138 transitions, 16703 flow [2025-04-13 20:31:24,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12211, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=547, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=16703, PETRI_PLACES=271, PETRI_TRANSITIONS=1138} [2025-04-13 20:31:24,358 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2025-04-13 20:31:24,358 INFO L485 AbstractCegarLoop]: Abstraction has has 271 places, 1138 transitions, 16703 flow [2025-04-13 20:31:24,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 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-04-13 20:31:24,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:24,358 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-04-13 20:31:24,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 20:31:24,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 20:31:24,559 INFO L403 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-04-13 20:31:24,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:24,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1600212369, now seen corresponding path program 10 times [2025-04-13 20:31:24,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:24,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67932960] [2025-04-13 20:31:24,559 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:31:24,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:24,564 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:24,574 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:24,574 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:31:24,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:24,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:24,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67932960] [2025-04-13 20:31:24,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67932960] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:24,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352891397] [2025-04-13 20:31:24,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:31:24,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:24,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:24,961 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:24,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:31:25,014 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:25,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:25,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:31:25,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:25,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:31:25,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:25,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:31:25,058 INFO L354 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-04-13 20:31:25,077 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:31:25,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:31:25,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:31:25,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:31:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:25,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352891397] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:25,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:25,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 24 [2025-04-13 20:31:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700736089] [2025-04-13 20:31:25,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:25,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:31:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:25,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:31:25,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:31:25,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:25,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 1138 transitions, 16703 flow. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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-04-13 20:31:25,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:25,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:25,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:29,006 INFO L116 PetriNetUnfolderBase]: 10850/15335 cut-off events. [2025-04-13 20:31:29,006 INFO L117 PetriNetUnfolderBase]: For 161540/161540 co-relation queries the response was YES. [2025-04-13 20:31:29,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107990 conditions, 15335 events. 10850/15335 cut-off events. For 161540/161540 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 87409 event pairs, 1217 based on Foata normal form. 3/12887 useless extension candidates. Maximal degree in co-relation 107661. Up to 11545 conditions per place. [2025-04-13 20:31:29,155 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 829 selfloop transitions, 662 changer transitions 1/1492 dead transitions. [2025-04-13 20:31:29,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1492 transitions, 23662 flow [2025-04-13 20:31:29,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 20:31:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-13 20:31:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 445 transitions. [2025-04-13 20:31:29,157 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3391768292682927 [2025-04-13 20:31:29,157 INFO L175 Difference]: Start difference. First operand has 271 places, 1138 transitions, 16703 flow. Second operand 41 states and 445 transitions. [2025-04-13 20:31:29,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 1492 transitions, 23662 flow [2025-04-13 20:31:31,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 1492 transitions, 22900 flow, removed 331 selfloop flow, removed 6 redundant places. [2025-04-13 20:31:31,495 INFO L231 Difference]: Finished difference. Result has 313 places, 1350 transitions, 20992 flow [2025-04-13 20:31:31,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=16074, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=459, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=20992, PETRI_PLACES=313, PETRI_TRANSITIONS=1350} [2025-04-13 20:31:31,497 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 282 predicate places. [2025-04-13 20:31:31,497 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 1350 transitions, 20992 flow [2025-04-13 20:31:31,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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-04-13 20:31:31,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:31,497 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-04-13 20:31:31,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:31:31,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 20:31:31,701 INFO L403 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-04-13 20:31:31,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash 399697183, now seen corresponding path program 11 times [2025-04-13 20:31:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:31,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179395857] [2025-04-13 20:31:31,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:31,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:31,706 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:31,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:31,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:31,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:31,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:31,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179395857] [2025-04-13 20:31:31,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179395857] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:31,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651358252] [2025-04-13 20:31:31,985 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:31,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:31,987 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:31,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:31:32,035 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:32,055 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:32,056 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:32,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:32,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:31:32,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:32,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:31:32,081 INFO L354 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-04-13 20:31:32,099 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:31:32,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:31:32,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:31:32,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:31:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:32,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651358252] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:32,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:32,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 24 [2025-04-13 20:31:32,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726232134] [2025-04-13 20:31:32,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:32,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:31:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:32,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:31:32,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:31:32,416 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:32,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 1350 transitions, 20992 flow. Second operand has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 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-04-13 20:31:32,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:32,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:32,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:35,718 INFO L116 PetriNetUnfolderBase]: 10860/15358 cut-off events. [2025-04-13 20:31:35,718 INFO L117 PetriNetUnfolderBase]: For 148128/148128 co-relation queries the response was YES. [2025-04-13 20:31:35,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111373 conditions, 15358 events. 10860/15358 cut-off events. For 148128/148128 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 87194 event pairs, 2201 based on Foata normal form. 1/12929 useless extension candidates. Maximal degree in co-relation 111110. Up to 14460 conditions per place. [2025-04-13 20:31:35,858 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1128 selfloop transitions, 253 changer transitions 1/1382 dead transitions. [2025-04-13 20:31:35,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1382 transitions, 23959 flow [2025-04-13 20:31:35,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:31:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:31:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2025-04-13 20:31:35,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3177083333333333 [2025-04-13 20:31:35,859 INFO L175 Difference]: Start difference. First operand has 313 places, 1350 transitions, 20992 flow. Second operand 12 states and 122 transitions. [2025-04-13 20:31:35,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1382 transitions, 23959 flow [2025-04-13 20:31:37,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1382 transitions, 23355 flow, removed 74 selfloop flow, removed 15 redundant places. [2025-04-13 20:31:37,683 INFO L231 Difference]: Finished difference. Result has 310 places, 1352 transitions, 20943 flow [2025-04-13 20:31:37,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20388, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1097, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=20943, PETRI_PLACES=310, PETRI_TRANSITIONS=1352} [2025-04-13 20:31:37,684 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 279 predicate places. [2025-04-13 20:31:37,684 INFO L485 AbstractCegarLoop]: Abstraction has has 310 places, 1352 transitions, 20943 flow [2025-04-13 20:31:37,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 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-04-13 20:31:37,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:37,685 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-04-13 20:31:37,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:37,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 20:31:37,885 INFO L403 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-04-13 20:31:37,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1484130837, now seen corresponding path program 12 times [2025-04-13 20:31:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:37,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511511415] [2025-04-13 20:31:37,886 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:37,891 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:37,900 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:37,901 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:31:37,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:38,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511511415] [2025-04-13 20:31:38,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511511415] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:38,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287892404] [2025-04-13 20:31:38,132 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:38,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:38,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:38,136 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:38,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:31:38,190 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:38,207 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:38,207 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:31:38,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:38,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:38,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:38,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:38,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:31:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:38,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:38,400 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:38,400 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:31:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287892404] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:38,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:38,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2025-04-13 20:31:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015816420] [2025-04-13 20:31:38,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:38,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:31:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:38,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:31:38,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:31:38,575 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:38,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 1352 transitions, 20943 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:38,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:38,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:38,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:41,915 INFO L116 PetriNetUnfolderBase]: 11431/16214 cut-off events. [2025-04-13 20:31:41,916 INFO L117 PetriNetUnfolderBase]: For 161227/161227 co-relation queries the response was YES. [2025-04-13 20:31:42,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116153 conditions, 16214 events. 11431/16214 cut-off events. For 161227/161227 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 93984 event pairs, 1783 based on Foata normal form. 2/13566 useless extension candidates. Maximal degree in co-relation 115890. Up to 12729 conditions per place. [2025-04-13 20:31:42,061 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 884 selfloop transitions, 606 changer transitions 2/1492 dead transitions. [2025-04-13 20:31:42,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1492 transitions, 25431 flow [2025-04-13 20:31:42,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:31:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:31:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2025-04-13 20:31:42,063 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3355263157894737 [2025-04-13 20:31:42,063 INFO L175 Difference]: Start difference. First operand has 310 places, 1352 transitions, 20943 flow. Second operand 19 states and 204 transitions. [2025-04-13 20:31:42,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 1492 transitions, 25431 flow [2025-04-13 20:31:43,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 1492 transitions, 25215 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-04-13 20:31:43,889 INFO L231 Difference]: Finished difference. Result has 331 places, 1415 transitions, 23533 flow [2025-04-13 20:31:43,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20733, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=545, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=23533, PETRI_PLACES=331, PETRI_TRANSITIONS=1415} [2025-04-13 20:31:43,890 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 300 predicate places. [2025-04-13 20:31:43,890 INFO L485 AbstractCegarLoop]: Abstraction has has 331 places, 1415 transitions, 23533 flow [2025-04-13 20:31:43,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:43,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:43,891 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-04-13 20:31:43,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:31:44,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 20:31:44,091 INFO L403 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-04-13 20:31:44,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1961408981, now seen corresponding path program 13 times [2025-04-13 20:31:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:44,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322475082] [2025-04-13 20:31:44,092 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:44,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:31:44,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:44,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:44,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:44,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322475082] [2025-04-13 20:31:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322475082] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:44,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115162949] [2025-04-13 20:31:44,395 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:44,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:44,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:44,397 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:44,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:31:44,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:31:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:44,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:31:44,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:44,470 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:31:44,484 INFO L354 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-04-13 20:31:44,540 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:31:44,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:31:44,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:31:44,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:31:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:44,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115162949] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:44,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2025-04-13 20:31:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311232323] [2025-04-13 20:31:44,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:44,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:31:44,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:44,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:31:44,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:31:44,831 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:44,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1415 transitions, 23533 flow. Second operand has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:44,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:44,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:44,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:48,736 INFO L116 PetriNetUnfolderBase]: 11455/16257 cut-off events. [2025-04-13 20:31:48,737 INFO L117 PetriNetUnfolderBase]: For 167096/167096 co-relation queries the response was YES. [2025-04-13 20:31:48,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122861 conditions, 16257 events. 11455/16257 cut-off events. For 167096/167096 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 94482 event pairs, 2424 based on Foata normal form. 1/13602 useless extension candidates. Maximal degree in co-relation 122588. Up to 15364 conditions per place. [2025-04-13 20:31:48,895 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1175 selfloop transitions, 270 changer transitions 1/1446 dead transitions. [2025-04-13 20:31:48,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 1446 transitions, 26605 flow [2025-04-13 20:31:48,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:31:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:31:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2025-04-13 20:31:48,896 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3013392857142857 [2025-04-13 20:31:48,896 INFO L175 Difference]: Start difference. First operand has 331 places, 1415 transitions, 23533 flow. Second operand 14 states and 135 transitions. [2025-04-13 20:31:48,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 1446 transitions, 26605 flow [2025-04-13 20:31:51,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1446 transitions, 26400 flow, removed 75 selfloop flow, removed 3 redundant places. [2025-04-13 20:31:51,152 INFO L231 Difference]: Finished difference. Result has 343 places, 1419 transitions, 23945 flow [2025-04-13 20:31:51,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23328, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=23945, PETRI_PLACES=343, PETRI_TRANSITIONS=1419} [2025-04-13 20:31:51,153 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 312 predicate places. [2025-04-13 20:31:51,153 INFO L485 AbstractCegarLoop]: Abstraction has has 343 places, 1419 transitions, 23945 flow [2025-04-13 20:31:51,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:51,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:51,154 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-04-13 20:31:51,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:51,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:51,354 INFO L403 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-04-13 20:31:51,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:51,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1568703057, now seen corresponding path program 14 times [2025-04-13 20:31:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:51,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725824455] [2025-04-13 20:31:51,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:51,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:51,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:51,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:51,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:51,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:51,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725824455] [2025-04-13 20:31:51,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725824455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:51,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104869730] [2025-04-13 20:31:51,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:51,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:51,910 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:51,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:31:51,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:51,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:51,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:51,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:51,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:51,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:52,116 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:52,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:31:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:52,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:52,196 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:52,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:31:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104869730] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:52,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:52,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 22 [2025-04-13 20:31:52,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931749705] [2025-04-13 20:31:52,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:52,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:31:52,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:52,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:31:52,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:31:52,347 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:52,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1419 transitions, 23945 flow. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 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-04-13 20:31:52,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:52,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:52,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:55,736 INFO L116 PetriNetUnfolderBase]: 11495/16328 cut-off events. [2025-04-13 20:31:55,736 INFO L117 PetriNetUnfolderBase]: For 171849/171849 co-relation queries the response was YES. [2025-04-13 20:31:55,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124183 conditions, 16328 events. 11495/16328 cut-off events. For 171849/171849 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 95103 event pairs, 2420 based on Foata normal form. 1/13667 useless extension candidates. Maximal degree in co-relation 123907. Up to 15403 conditions per place. [2025-04-13 20:31:55,896 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1182 selfloop transitions, 278 changer transitions 1/1461 dead transitions. [2025-04-13 20:31:55,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1461 transitions, 27144 flow [2025-04-13 20:31:55,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:31:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:31:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 141 transitions. [2025-04-13 20:31:55,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31473214285714285 [2025-04-13 20:31:55,897 INFO L175 Difference]: Start difference. First operand has 343 places, 1419 transitions, 23945 flow. Second operand 14 states and 141 transitions. [2025-04-13 20:31:55,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1461 transitions, 27144 flow [2025-04-13 20:31:58,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1461 transitions, 26801 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-04-13 20:31:58,097 INFO L231 Difference]: Finished difference. Result has 349 places, 1430 transitions, 24316 flow [2025-04-13 20:31:58,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23602, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=24316, PETRI_PLACES=349, PETRI_TRANSITIONS=1430} [2025-04-13 20:31:58,099 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 318 predicate places. [2025-04-13 20:31:58,099 INFO L485 AbstractCegarLoop]: Abstraction has has 349 places, 1430 transitions, 24316 flow [2025-04-13 20:31:58,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 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-04-13 20:31:58,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:58,099 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-04-13 20:31:58,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:58,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 20:31:58,299 INFO L403 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-04-13 20:31:58,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1443449711, now seen corresponding path program 15 times [2025-04-13 20:31:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:58,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415566617] [2025-04-13 20:31:58,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:58,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:58,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:58,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:31:58,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:58,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415566617] [2025-04-13 20:31:58,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415566617] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:58,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418399809] [2025-04-13 20:31:58,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:58,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:58,594 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:58,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:31:58,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:31:58,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:31:58,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:31:58,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:58,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:58,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:58,810 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:58,810 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:31:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:58,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:58,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:58,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:31:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:31:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418399809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:31:58,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:31:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2025-04-13 20:31:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070564230] [2025-04-13 20:31:58,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:31:58,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:31:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:58,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:31:58,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:31:58,979 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:58,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1430 transitions, 24316 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:58,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:58,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:58,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:04,336 INFO L116 PetriNetUnfolderBase]: 14817/20913 cut-off events. [2025-04-13 20:32:04,337 INFO L117 PetriNetUnfolderBase]: For 238329/238329 co-relation queries the response was YES. [2025-04-13 20:32:04,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159985 conditions, 20913 events. 14817/20913 cut-off events. For 238329/238329 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 124554 event pairs, 1201 based on Foata normal form. 1/17369 useless extension candidates. Maximal degree in co-relation 159696. Up to 12020 conditions per place. [2025-04-13 20:32:04,601 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 714 selfloop transitions, 1269 changer transitions 1/1984 dead transitions. [2025-04-13 20:32:04,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 1984 transitions, 36361 flow [2025-04-13 20:32:04,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 20:32:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 20:32:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 464 transitions. [2025-04-13 20:32:04,602 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3372093023255814 [2025-04-13 20:32:04,602 INFO L175 Difference]: Start difference. First operand has 349 places, 1430 transitions, 24316 flow. Second operand 43 states and 464 transitions. [2025-04-13 20:32:04,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 1984 transitions, 36361 flow [2025-04-13 20:32:08,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 1984 transitions, 35984 flow, removed 18 selfloop flow, removed 9 redundant places. [2025-04-13 20:32:08,289 INFO L231 Difference]: Finished difference. Result has 394 places, 1810 transitions, 34582 flow [2025-04-13 20:32:08,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23991, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=938, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=34582, PETRI_PLACES=394, PETRI_TRANSITIONS=1810} [2025-04-13 20:32:08,290 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 363 predicate places. [2025-04-13 20:32:08,290 INFO L485 AbstractCegarLoop]: Abstraction has has 394 places, 1810 transitions, 34582 flow [2025-04-13 20:32:08,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:08,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:08,290 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-04-13 20:32:08,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:32:08,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 20:32:08,491 INFO L403 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-04-13 20:32:08,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:08,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1754264341, now seen corresponding path program 16 times [2025-04-13 20:32:08,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:08,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438011224] [2025-04-13 20:32:08,492 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:32:08,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:08,496 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:08,502 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:08,502 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:32:08,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:08,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438011224] [2025-04-13 20:32:08,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438011224] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:08,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687245329] [2025-04-13 20:32:08,828 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:32:08,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:08,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:08,830 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:32:08,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:32:08,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:08,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:08,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:32:08,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:08,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:32:08,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:08,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:32:08,924 INFO L354 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-04-13 20:32:08,940 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:32:08,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:32:08,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:32:09,086 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:32:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:32:09,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687245329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:32:09,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:32:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2025-04-13 20:32:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120388332] [2025-04-13 20:32:09,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:32:09,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:32:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:09,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:32:09,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:32:09,232 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:09,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 1810 transitions, 34582 flow. Second operand has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 states have internal predecessors, (138), 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-04-13 20:32:09,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:09,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:09,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:16,718 INFO L116 PetriNetUnfolderBase]: 15555/22137 cut-off events. [2025-04-13 20:32:16,719 INFO L117 PetriNetUnfolderBase]: For 295717/295717 co-relation queries the response was YES. [2025-04-13 20:32:17,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183996 conditions, 22137 events. 15555/22137 cut-off events. For 295717/295717 co-relation queries the response was YES. Maximal size of possible extension queue 1445. Compared 135155 event pairs, 2277 based on Foata normal form. 2/18476 useless extension candidates. Maximal degree in co-relation 183760. Up to 15888 conditions per place. [2025-04-13 20:32:17,174 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 933 selfloop transitions, 1309 changer transitions 5/2247 dead transitions. [2025-04-13 20:32:17,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 2247 transitions, 45864 flow [2025-04-13 20:32:17,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 20:32:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-13 20:32:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 420 transitions. [2025-04-13 20:32:17,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2025-04-13 20:32:17,175 INFO L175 Difference]: Start difference. First operand has 394 places, 1810 transitions, 34582 flow. Second operand 45 states and 420 transitions. [2025-04-13 20:32:17,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 2247 transitions, 45864 flow [2025-04-13 20:32:22,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 2247 transitions, 44236 flow, removed 302 selfloop flow, removed 15 redundant places. [2025-04-13 20:32:22,905 INFO L231 Difference]: Finished difference. Result has 439 places, 2145 transitions, 43002 flow [2025-04-13 20:32:22,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33149, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=748, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=43002, PETRI_PLACES=439, PETRI_TRANSITIONS=2145} [2025-04-13 20:32:22,906 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 408 predicate places. [2025-04-13 20:32:22,906 INFO L485 AbstractCegarLoop]: Abstraction has has 439 places, 2145 transitions, 43002 flow [2025-04-13 20:32:22,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 states have internal predecessors, (138), 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-04-13 20:32:22,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:22,906 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-04-13 20:32:22,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 20:32:23,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:23,107 INFO L403 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-04-13 20:32:23,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash 588013035, now seen corresponding path program 17 times [2025-04-13 20:32:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:23,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133579318] [2025-04-13 20:32:23,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:32:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:23,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:23,120 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:23,120 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:32:23,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:23,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:23,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133579318] [2025-04-13 20:32:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133579318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:23,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823885362] [2025-04-13 20:32:23,349 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:32:23,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:23,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:23,351 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:32:23,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:32:23,408 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:23,427 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:23,427 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:32:23,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:23,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 20:32:23,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:23,456 INFO L354 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-04-13 20:32:23,573 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:23,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 81 [2025-04-13 20:32:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:23,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823885362] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:32:23,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:32:23,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 20 [2025-04-13 20:32:23,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531538634] [2025-04-13 20:32:23,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:32:23,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:32:23,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:23,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:32:23,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:32:23,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:23,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 2145 transitions, 43002 flow. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 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-04-13 20:32:23,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:23,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:23,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:31,136 INFO L116 PetriNetUnfolderBase]: 17203/24500 cut-off events. [2025-04-13 20:32:31,137 INFO L117 PetriNetUnfolderBase]: For 382229/382229 co-relation queries the response was YES. [2025-04-13 20:32:31,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211303 conditions, 24500 events. 17203/24500 cut-off events. For 382229/382229 co-relation queries the response was YES. Maximal size of possible extension queue 1487. Compared 152232 event pairs, 1385 based on Foata normal form. 1/20649 useless extension candidates. Maximal degree in co-relation 210987. Up to 11533 conditions per place. [2025-04-13 20:32:31,645 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 549 selfloop transitions, 1878 changer transitions 2/2429 dead transitions. [2025-04-13 20:32:31,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 2429 transitions, 51848 flow [2025-04-13 20:32:31,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 20:32:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 20:32:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 370 transitions. [2025-04-13 20:32:31,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3503787878787879 [2025-04-13 20:32:31,646 INFO L175 Difference]: Start difference. First operand has 439 places, 2145 transitions, 43002 flow. Second operand 33 states and 370 transitions. [2025-04-13 20:32:31,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 2429 transitions, 51848 flow [2025-04-13 20:32:40,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 2429 transitions, 50589 flow, removed 534 selfloop flow, removed 5 redundant places. [2025-04-13 20:32:40,753 INFO L231 Difference]: Finished difference. Result has 475 places, 2317 transitions, 50303 flow [2025-04-13 20:32:40,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=41881, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1740, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=50303, PETRI_PLACES=475, PETRI_TRANSITIONS=2317} [2025-04-13 20:32:40,754 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 444 predicate places. [2025-04-13 20:32:40,755 INFO L485 AbstractCegarLoop]: Abstraction has has 475 places, 2317 transitions, 50303 flow [2025-04-13 20:32:40,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 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-04-13 20:32:40,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:40,755 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-04-13 20:32:40,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 20:32:40,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:40,955 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:40,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1175716129, now seen corresponding path program 18 times [2025-04-13 20:32:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:40,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402664587] [2025-04-13 20:32:40,956 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:32:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:40,960 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:40,969 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:40,969 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:32:40,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:41,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:41,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402664587] [2025-04-13 20:32:41,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402664587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:41,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310592035] [2025-04-13 20:32:41,231 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:32:41,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:41,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:41,232 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:32:41,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:32:41,283 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:32:41,299 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:41,299 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:32:41,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:41,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:32:41,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:41,404 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:41,404 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:32:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:41,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:41,473 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:41,473 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:32:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:32:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310592035] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:32:41,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:32:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-13 20:32:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153310320] [2025-04-13 20:32:41,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:32:41,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 20:32:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:41,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 20:32:41,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-04-13 20:32:41,588 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:41,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 2317 transitions, 50303 flow. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 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-04-13 20:32:41,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:41,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:41,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:49,848 INFO L116 PetriNetUnfolderBase]: 17271/24611 cut-off events. [2025-04-13 20:32:49,848 INFO L117 PetriNetUnfolderBase]: For 421045/421045 co-relation queries the response was YES. [2025-04-13 20:32:50,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226559 conditions, 24611 events. 17271/24611 cut-off events. For 421045/421045 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 153178 event pairs, 3115 based on Foata normal form. 1/20742 useless extension candidates. Maximal degree in co-relation 226282. Up to 20632 conditions per place. [2025-04-13 20:32:50,306 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1557 selfloop transitions, 848 changer transitions 1/2406 dead transitions. [2025-04-13 20:32:50,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 2406 transitions, 55844 flow [2025-04-13 20:32:50,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:32:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:32:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 272 transitions. [2025-04-13 20:32:50,307 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2025-04-13 20:32:50,307 INFO L175 Difference]: Start difference. First operand has 475 places, 2317 transitions, 50303 flow. Second operand 24 states and 272 transitions. [2025-04-13 20:32:50,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 2406 transitions, 55844 flow [2025-04-13 20:33:00,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 2406 transitions, 54785 flow, removed 360 selfloop flow, removed 7 redundant places. [2025-04-13 20:33:00,068 INFO L231 Difference]: Finished difference. Result has 495 places, 2331 transitions, 51366 flow [2025-04-13 20:33:00,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49250, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=834, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=51366, PETRI_PLACES=495, PETRI_TRANSITIONS=2331} [2025-04-13 20:33:00,069 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 464 predicate places. [2025-04-13 20:33:00,069 INFO L485 AbstractCegarLoop]: Abstraction has has 495 places, 2331 transitions, 51366 flow [2025-04-13 20:33:00,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 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-04-13 20:33:00,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:00,070 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-04-13 20:33:00,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 20:33:00,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:00,270 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:00,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash 372990107, now seen corresponding path program 19 times [2025-04-13 20:33:00,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:00,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129223974] [2025-04-13 20:33:00,271 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:00,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:00,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:00,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:00,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:00,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129223974] [2025-04-13 20:33:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129223974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:00,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719845317] [2025-04-13 20:33:00,579 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:33:00,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:00,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:00,581 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:33:00,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:33:00,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:00,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:00,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:00,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:00,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:33:00,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:00,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:33:00,665 INFO L354 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-04-13 20:33:00,681 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:33:00,681 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:33:00,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:33:00,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:33:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:00,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719845317] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:00,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:00,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2025-04-13 20:33:00,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114066138] [2025-04-13 20:33:00,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:00,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 20:33:00,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:00,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 20:33:00,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2025-04-13 20:33:00,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:33:00,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 2331 transitions, 51366 flow. Second operand has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:00,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:00,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:33:00,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:10,712 INFO L116 PetriNetUnfolderBase]: 19508/27746 cut-off events. [2025-04-13 20:33:10,712 INFO L117 PetriNetUnfolderBase]: For 453023/453023 co-relation queries the response was YES. [2025-04-13 20:33:11,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256102 conditions, 27746 events. 19508/27746 cut-off events. For 453023/453023 co-relation queries the response was YES. Maximal size of possible extension queue 1716. Compared 174914 event pairs, 2099 based on Foata normal form. 1/23302 useless extension candidates. Maximal degree in co-relation 255812. Up to 15147 conditions per place. [2025-04-13 20:33:11,295 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 800 selfloop transitions, 1893 changer transitions 2/2695 dead transitions. [2025-04-13 20:33:11,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 2695 transitions, 62433 flow [2025-04-13 20:33:11,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 20:33:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 20:33:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2025-04-13 20:33:11,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32848837209302323 [2025-04-13 20:33:11,297 INFO L175 Difference]: Start difference. First operand has 495 places, 2331 transitions, 51366 flow. Second operand 43 states and 452 transitions. [2025-04-13 20:33:11,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 2695 transitions, 62433 flow [2025-04-13 20:33:21,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 2695 transitions, 61511 flow, removed 72 selfloop flow, removed 11 redundant places. [2025-04-13 20:33:21,863 INFO L231 Difference]: Finished difference. Result has 536 places, 2560 transitions, 60638 flow [2025-04-13 20:33:21,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50473, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1686, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=60638, PETRI_PLACES=536, PETRI_TRANSITIONS=2560} [2025-04-13 20:33:21,865 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 505 predicate places. [2025-04-13 20:33:21,865 INFO L485 AbstractCegarLoop]: Abstraction has has 536 places, 2560 transitions, 60638 flow [2025-04-13 20:33:21,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.074074074074074) internal successors, (137), 27 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:21,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:21,866 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-04-13 20:33:21,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 20:33:22,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 20:33:22,066 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:22,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2021986415, now seen corresponding path program 20 times [2025-04-13 20:33:22,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:22,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535644051] [2025-04-13 20:33:22,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:22,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:22,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:22,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:22,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:22,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:22,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:22,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535644051] [2025-04-13 20:33:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535644051] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:22,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676872289] [2025-04-13 20:33:22,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:22,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:22,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:22,303 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:33:22,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:33:22,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:22,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:22,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:22,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:22,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:33:22,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:22,493 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:22,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:33:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:22,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:22,571 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:22,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:33:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676872289] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:22,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:22,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2025-04-13 20:33:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897746868] [2025-04-13 20:33:22,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:22,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:33:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:22,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:33:22,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:33:22,686 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:33:22,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 2560 transitions, 60638 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:22,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:22,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:33:22,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:32,489 INFO L116 PetriNetUnfolderBase]: 19532/27800 cut-off events. [2025-04-13 20:33:32,489 INFO L117 PetriNetUnfolderBase]: For 508145/508145 co-relation queries the response was YES. [2025-04-13 20:33:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273681 conditions, 27800 events. 19532/27800 cut-off events. For 508145/508145 co-relation queries the response was YES. Maximal size of possible extension queue 1687. Compared 175476 event pairs, 3869 based on Foata normal form. 2/23357 useless extension candidates. Maximal degree in co-relation 273368. Up to 23830 conditions per place. [2025-04-13 20:33:33,130 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1790 selfloop transitions, 851 changer transitions 2/2643 dead transitions. [2025-04-13 20:33:33,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 2643 transitions, 66579 flow [2025-04-13 20:33:33,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:33:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:33:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 272 transitions. [2025-04-13 20:33:33,135 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2025-04-13 20:33:33,135 INFO L175 Difference]: Start difference. First operand has 536 places, 2560 transitions, 60638 flow. Second operand 24 states and 272 transitions. [2025-04-13 20:33:33,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 2643 transitions, 66579 flow [2025-04-13 20:33:45,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 2643 transitions, 64936 flow, removed 115 selfloop flow, removed 22 redundant places. [2025-04-13 20:33:45,600 INFO L231 Difference]: Finished difference. Result has 540 places, 2567 transitions, 60876 flow [2025-04-13 20:33:45,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59002, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=846, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=60876, PETRI_PLACES=540, PETRI_TRANSITIONS=2567} [2025-04-13 20:33:45,602 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 509 predicate places. [2025-04-13 20:33:45,602 INFO L485 AbstractCegarLoop]: Abstraction has has 540 places, 2567 transitions, 60876 flow [2025-04-13 20:33:45,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:45,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:45,602 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-04-13 20:33:45,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:33:45,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 20:33:45,803 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:33:45,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1667926847, now seen corresponding path program 21 times [2025-04-13 20:33:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:45,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51335991] [2025-04-13 20:33:45,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:33:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:45,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:45,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:45,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:33:45,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:46,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51335991] [2025-04-13 20:33:46,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51335991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:46,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148325969] [2025-04-13 20:33:46,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:33:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:46,121 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:33:46,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:33:46,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:46,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:46,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:33:46,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:46,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:33:46,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:46,336 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:46,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 20:33:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:46,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:46,427 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:33:46,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 78 [2025-04-13 20:33:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:33:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148325969] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:46,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2025-04-13 20:33:46,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435531109] [2025-04-13 20:33:46,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:46,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 20:33:46,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:46,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 20:33:46,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-04-13 20:33:46,504 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:33:46,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 2567 transitions, 60876 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:46,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:46,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:33:46,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:56,646 INFO L116 PetriNetUnfolderBase]: 19576/27891 cut-off events. [2025-04-13 20:33:56,646 INFO L117 PetriNetUnfolderBase]: For 518298/518298 co-relation queries the response was YES. [2025-04-13 20:33:57,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276299 conditions, 27891 events. 19576/27891 cut-off events. For 518298/518298 co-relation queries the response was YES. Maximal size of possible extension queue 1760. Compared 176828 event pairs, 4016 based on Foata normal form. 2/23442 useless extension candidates. Maximal degree in co-relation 275983. Up to 23876 conditions per place. [2025-04-13 20:33:57,348 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1808 selfloop transitions, 822 changer transitions 3/2633 dead transitions. [2025-04-13 20:33:57,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 2633 transitions, 66732 flow [2025-04-13 20:33:57,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 20:33:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 20:33:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 206 transitions. [2025-04-13 20:33:57,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33881578947368424 [2025-04-13 20:33:57,350 INFO L175 Difference]: Start difference. First operand has 540 places, 2567 transitions, 60876 flow. Second operand 19 states and 206 transitions. [2025-04-13 20:33:57,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 2633 transitions, 66732 flow [2025-04-13 20:34:10,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 2633 transitions, 65524 flow, removed 40 selfloop flow, removed 19 redundant places. [2025-04-13 20:34:10,225 INFO L231 Difference]: Finished difference. Result has 543 places, 2582 transitions, 61652 flow [2025-04-13 20:34:10,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59668, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=809, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=61652, PETRI_PLACES=543, PETRI_TRANSITIONS=2582} [2025-04-13 20:34:10,227 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 512 predicate places. [2025-04-13 20:34:10,227 INFO L485 AbstractCegarLoop]: Abstraction has has 543 places, 2582 transitions, 61652 flow [2025-04-13 20:34:10,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:34:10,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:10,227 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-04-13 20:34:10,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 20:34:10,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:10,431 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:10,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1713571707, now seen corresponding path program 22 times [2025-04-13 20:34:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:10,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183980438] [2025-04-13 20:34:10,432 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:34:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:10,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:10,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:10,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:34:10,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:10,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:34:10,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:10,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183980438] [2025-04-13 20:34:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183980438] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:10,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846586020] [2025-04-13 20:34:10,960 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:34:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:10,962 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:34:10,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:34:11,022 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:11,043 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:11,043 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:34:11,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:11,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 20:34:11,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:11,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:34:11,071 INFO L354 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-04-13 20:34:11,091 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:34:11,091 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:34:11,113 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:34:11,236 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 20:34:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:34:11,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:34:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846586020] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:34:11,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:34:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 24 [2025-04-13 20:34:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545207881] [2025-04-13 20:34:11,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:34:11,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:34:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:11,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:34:11,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:34:11,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:34:11,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 2582 transitions, 61652 flow. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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-04-13 20:34:11,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:11,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:34:11,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:23,962 INFO L116 PetriNetUnfolderBase]: 21914/31132 cut-off events. [2025-04-13 20:34:23,962 INFO L117 PetriNetUnfolderBase]: For 577683/577683 co-relation queries the response was YES. [2025-04-13 20:34:24,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310493 conditions, 31132 events. 21914/31132 cut-off events. For 577683/577683 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 198504 event pairs, 3816 based on Foata normal form. 5/26032 useless extension candidates. Maximal degree in co-relation 310127. Up to 24362 conditions per place. [2025-04-13 20:34:24,743 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1844 selfloop transitions, 1145 changer transitions 1/2990 dead transitions. [2025-04-13 20:34:24,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 2990 transitions, 75647 flow [2025-04-13 20:34:24,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 20:34:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-04-13 20:34:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 380 transitions. [2025-04-13 20:34:24,744 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3492647058823529 [2025-04-13 20:34:24,744 INFO L175 Difference]: Start difference. First operand has 543 places, 2582 transitions, 61652 flow. Second operand 34 states and 380 transitions. [2025-04-13 20:34:24,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 2990 transitions, 75647 flow [2025-04-13 20:34:40,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 2990 transitions, 74685 flow, removed 59 selfloop flow, removed 12 redundant places. [2025-04-13 20:34:40,188 INFO L231 Difference]: Finished difference. Result has 573 places, 2848 transitions, 70528 flow [2025-04-13 20:34:40,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60820, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=881, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=70528, PETRI_PLACES=573, PETRI_TRANSITIONS=2848} [2025-04-13 20:34:40,191 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 542 predicate places. [2025-04-13 20:34:40,191 INFO L485 AbstractCegarLoop]: Abstraction has has 573 places, 2848 transitions, 70528 flow [2025-04-13 20:34:40,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 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-04-13 20:34:40,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:40,191 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] [2025-04-13 20:34:40,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 20:34:40,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:40,392 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:34:40,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1274041694, now seen corresponding path program 23 times [2025-04-13 20:34:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:40,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366434388] [2025-04-13 20:34:40,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:34:40,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:40,397 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:34:40,401 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:34:40,401 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:34:40,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:40,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:40,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366434388] [2025-04-13 20:34:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366434388] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:34:40,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036934826] [2025-04-13 20:34:40,440 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:34:40,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:40,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:34:40,442 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:34:40,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 20:34:40,504 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:34:40,525 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:34:40,525 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:34:40,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:40,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:34:40,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:34:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:40,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:34:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:40,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036934826] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:34:40,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:34:40,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:34:40,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129052414] [2025-04-13 20:34:40,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:34:40,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:34:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:40,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:34:40,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:34:40,596 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:34:40,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 2848 transitions, 70528 flow. Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 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-04-13 20:34:40,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:40,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:34:40,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:51,981 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L66-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.base_3| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_3| 0) (<= v_~N~0_182 (+ |v_thread3Thread1of1ForFork0_~i~2#1_5| 1))) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_5|, ~N~0=v_~N~0_182} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_3|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_3|, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_1|, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_5|, ~N~0=v_~N~0_182} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_~tmp~1#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_~i~2#1][524], [Black: 2889#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1351#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 952#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 4048#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3108#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 2998#true, Black: 2366#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2265#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2830#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3352#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1730#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 180#(and (<= 1 ~N~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), Black: 3838#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 2422#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3305#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 1833#(and (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))), Black: 2068#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3814#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))))), Black: 744#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2771#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3743#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3412#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 617#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 1006#true, Black: 4219#(= ~res2~0 ~res1~0), Black: 2605#(and (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3804#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 962#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0)) (= ~M~0 0)), Black: 958#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3422#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 514#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 916#(and (= ~A~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), 1169#true, Black: 3868#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 10#thread3EXITtrue, 182#true, 40#(< ~M~0 ~N~0), Black: 3426#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 1781#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 2056#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3196#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 2672#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 3626#true, 11#thread1EXITtrue, 560#true, Black: 3184#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1162#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 544#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 3448#true, Black: 924#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), Black: 1179#(= ~res2~0 ~res1~0), Black: 3432#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0)), 2089#true, Black: 2874#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 1789#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4377#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1853#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3180#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 347#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 1017#(= ~res2~0 ~res1~0), Black: 3172#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3457#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 7#thread2EXITtrue, Black: 4273#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 4385#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ ~res2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1932#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 1774#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 3200#(and (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (< 0 ~M~0))), Black: 2052#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3115#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3458#(= ~res2~0 ~res1~0), Black: 2266#(= ~res2~0 ~res1~0), Black: 2957#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3218#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 464#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 528#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3859#true, Black: 938#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 2608#true, Black: 748#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3739#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 732#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 2620#(= ~res2~0 ~res1~0), Black: 720#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 966#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 532#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 942#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3222#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3790#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 1527#(= ~res2~0 ~res1~0), Black: 1016#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 934#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), Black: 4261#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 4208#true, 359#true, Black: 825#(and (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~M~0 0)), Black: 2066#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3400#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3621#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 4039#true, Black: 2370#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1987#(or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 936#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0) (= ~M~0 0)), 1342#true, Black: 3190#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 0)) (or (and (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (< 0 (+ ~A~0.offset 1)) (< 3 (+ (* ~N~0 4) ~A~0.offset))) (or (< ~A~0.offset 1) (< (+ 3 ~A~0.offset) (* ~N~0 4)))) (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)))), Black: 1924#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4393#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 1516#true, Black: 4094#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 2885#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3251#(or (= ~res2~0 ~res1~0) (< 0 ~M~0)), Black: 2981#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 194#(= ~res2~0 ~res1~0), Black: 349#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3224#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 43#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 2775#true, Black: 968#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~res1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3832#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 2929#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 674#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4035#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 948#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 3008#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), Black: 728#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 484#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 736#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 4203#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 2444#(= ~res2~0 ~res1~0), Black: 540#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 1336#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 366#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1511#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 244#(and (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2971#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 2412#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1352#(= ~res2~0 ~res1~0), Black: 818#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2977#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3160#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), 2256#true, Black: 3820#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1499#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 2433#true, Black: 2955#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3243#true, Black: 1322#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 536#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1857#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 4049#(= ~res2~0 ~res1~0), Black: 3613#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3009#(= ~res2~0 ~res1~0), Black: 4403#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3356#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2963#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 23#L87true, Black: 1178#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1676#true, Black: 1878#(= ~res2~0 ~res1~0), Black: 4381#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 546#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 716#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 524#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 2404#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 829#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 1013#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= ~M~0 0)), Black: 3632#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0)))), Black: 3166#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 0 ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 1 ~N~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (< 1 ~N~0)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3869#(= ~res2~0 ~res1~0), Black: 960#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= ~M~0 0)), Black: 1274#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 2406#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4401#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3840#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~B~0.offset 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))))) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)))), Black: 512#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 926#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) 0)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 772#(= ~res2~0 ~res1~0), Black: 516#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2100#(= ~res2~0 ~res1~0), Black: 718#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 762#true, 4425#(<= ~N~0 1), 1867#true]) [2025-04-13 20:34:51,982 INFO L286 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-04-13 20:34:51,982 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:34:51,982 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:34:51,982 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:34:51,983 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L66-1-->L66: Formula: (let ((.cse4 (* |v_thread3Thread1of1ForFork0_~i~2#1_8| 4))) (let ((.cse0 (select (select |v_#memory_int#1_161| v_~B~0.base_182) (+ v_~B~0.offset_182 .cse4))) (.cse2 (select (select |v_#memory_int#1_161| v_~A~0.base_202) (+ v_~A~0.offset_202 .cse4)))) (let ((.cse1 (<= 0 (+ .cse0 .cse2 2147483648))) (.cse3 (<= (+ .cse0 .cse2) 2147483647))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_8| v_~N~0_184) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_3| v_~res2~0_129) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_3| 2147483647)) 1 0) 0)) (not (= (ite (or (<= v_~res2~0_129 |v_thread3Thread1of1ForFork0_plus_#res#1_3|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_3| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_8| (+ |v_thread3Thread1of1ForFork0_~i~2#1_7| 1)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_3| (+ .cse0 v_~res2~0_129 .cse2)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_3| |v_thread3Thread1of1ForFork0_~tmp~1#1_7|) (<= |v_thread3Thread1of1ForFork0_~tmp~1#1_7| 2147483647) (not (= (ite (or (<= .cse0 0) .cse3) 1 0) 0)) .cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_~tmp~1#1_7| 2147483648)) .cse3)))) InVars {~A~0.base=v_~A~0.base_202, ~B~0.base=v_~B~0.base_182, ~A~0.offset=v_~A~0.offset_202, ~N~0=v_~N~0_184, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_7|, #memory_int#1=|v_#memory_int#1_161|, ~B~0.offset=v_~B~0.offset_182, ~res2~0=v_~res2~0_129} OutVars{~A~0.base=v_~A~0.base_202, thread3Thread1of1ForFork0_#t~ret13#1=|v_thread3Thread1of1ForFork0_#t~ret13#1_3|, thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_3|, ~B~0.base=v_~B~0.base_182, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~N~0=v_~N~0_184, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_3|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_8|, #memory_int#1=|v_#memory_int#1_161|, thread3Thread1of1ForFork0_#t~mem11#1=|v_thread3Thread1of1ForFork0_#t~mem11#1_3|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_3|, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_3|, ~A~0.offset=v_~A~0.offset_202, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_3|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_3|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_3|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_3|, ~B~0.offset=v_~B~0.offset_182, ~res2~0=v_~res2~0_129} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~ret13#1, thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_~tmp~1#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem11#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_plus_~b#1][525], [Black: 2889#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1351#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 952#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 4048#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3108#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 2998#true, Black: 2366#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2265#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2830#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3352#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1730#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 180#(and (<= 1 ~N~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), Black: 3838#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 2422#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3305#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 1833#(and (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))), Black: 2068#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3814#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))))), Black: 744#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2771#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3743#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3412#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 617#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 1006#true, Black: 4219#(= ~res2~0 ~res1~0), Black: 2605#(and (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3804#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 962#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0)) (= ~M~0 0)), Black: 958#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3422#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 514#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 916#(and (= ~A~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), 1169#true, Black: 3868#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 182#true, 40#(< ~M~0 ~N~0), Black: 3426#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 1781#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 2056#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3196#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 2672#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 3626#true, 11#thread1EXITtrue, 560#true, Black: 3184#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1162#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 544#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 3448#true, Black: 924#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), Black: 1179#(= ~res2~0 ~res1~0), Black: 3432#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0)), 2089#true, Black: 2874#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 1789#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4377#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1853#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3180#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 347#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 1017#(= ~res2~0 ~res1~0), Black: 3172#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3457#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 7#thread2EXITtrue, Black: 4273#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 4385#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ ~res2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1932#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 1774#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 3200#(and (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (< 0 ~M~0))), Black: 2052#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3115#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3458#(= ~res2~0 ~res1~0), Black: 2266#(= ~res2~0 ~res1~0), Black: 2957#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3218#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 464#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 528#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3859#true, Black: 938#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 2608#true, Black: 748#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3739#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 732#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 2620#(= ~res2~0 ~res1~0), Black: 720#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 966#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 532#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 942#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3222#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3790#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 1527#(= ~res2~0 ~res1~0), Black: 1016#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 934#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), Black: 4261#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 4208#true, 359#true, Black: 825#(and (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~M~0 0)), Black: 2066#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3400#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3621#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 4039#true, Black: 2370#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1987#(or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 936#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0) (= ~M~0 0)), 1342#true, Black: 3190#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 0)) (or (and (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (< 0 (+ ~A~0.offset 1)) (< 3 (+ (* ~N~0 4) ~A~0.offset))) (or (< ~A~0.offset 1) (< (+ 3 ~A~0.offset) (* ~N~0 4)))) (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)))), Black: 1924#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4393#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 1516#true, Black: 4094#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 2885#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3251#(or (= ~res2~0 ~res1~0) (< 0 ~M~0)), Black: 2981#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 194#(= ~res2~0 ~res1~0), Black: 349#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3224#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 43#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 2775#true, Black: 968#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~res1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3832#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 2929#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 674#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4035#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 948#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 3008#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), Black: 728#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 484#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 736#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 4203#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 2444#(= ~res2~0 ~res1~0), Black: 540#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 1336#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 366#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1511#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 244#(and (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2971#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 2412#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1352#(= ~res2~0 ~res1~0), Black: 818#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2977#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3160#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), 2256#true, Black: 3820#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1499#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 2433#true, Black: 2955#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3243#true, Black: 1322#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 536#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1857#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 4049#(= ~res2~0 ~res1~0), Black: 3613#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3009#(= ~res2~0 ~res1~0), Black: 4403#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3356#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2963#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 23#L87true, Black: 1178#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1676#true, 29#L66true, Black: 1878#(= ~res2~0 ~res1~0), Black: 4381#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 546#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 716#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 524#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 2404#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 829#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 1013#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= ~M~0 0)), Black: 3632#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0)))), Black: 3166#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 0 ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 1 ~N~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (< 1 ~N~0)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3869#(= ~res2~0 ~res1~0), Black: 960#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= ~M~0 0)), Black: 1274#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 2406#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4401#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3840#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~B~0.offset 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))))) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)))), Black: 512#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 926#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) 0)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 772#(= ~res2~0 ~res1~0), Black: 516#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2100#(= ~res2~0 ~res1~0), Black: 718#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 762#true, 4425#(<= ~N~0 1), 1867#true]) [2025-04-13 20:34:51,984 INFO L286 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-04-13 20:34:51,984 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:34:51,984 INFO L289 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-04-13 20:34:51,984 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:34:53,451 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L66-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.base_3| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_3| 0) (<= v_~N~0_182 (+ |v_thread3Thread1of1ForFork0_~i~2#1_5| 1))) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_5|, ~N~0=v_~N~0_182} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_3|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_3|, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_1|, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_5|, ~N~0=v_~N~0_182} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_~tmp~1#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_~i~2#1][524], [Black: 2889#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1351#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 952#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 4048#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3108#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 2998#true, Black: 2366#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2265#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2830#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3352#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1730#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3838#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 180#(and (<= 1 ~N~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), Black: 2422#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3305#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 1833#(and (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))), Black: 2068#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3814#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))))), Black: 744#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2771#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3743#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3412#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 617#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 1006#true, Black: 4219#(= ~res2~0 ~res1~0), Black: 2605#(and (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3804#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 962#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0)) (= ~M~0 0)), Black: 958#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3422#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 514#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 916#(and (= ~A~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), 1169#true, Black: 3868#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 10#thread3EXITtrue, 182#true, 40#(< ~M~0 ~N~0), Black: 3426#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 1781#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 2056#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3196#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 2672#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 3626#true, 560#true, Black: 3184#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1162#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 544#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 3448#true, Black: 924#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), Black: 1179#(= ~res2~0 ~res1~0), Black: 3432#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0)), 2089#true, Black: 2874#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 1789#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4377#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1853#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3180#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 347#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 1017#(= ~res2~0 ~res1~0), Black: 3172#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3457#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 7#thread2EXITtrue, Black: 4273#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 4385#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ ~res2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1932#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 1774#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), 8#L87-1true, Black: 3200#(and (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (< 0 ~M~0))), Black: 2052#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3115#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3458#(= ~res2~0 ~res1~0), Black: 2266#(= ~res2~0 ~res1~0), Black: 2957#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3218#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 464#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 528#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3859#true, Black: 938#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 2608#true, Black: 748#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3739#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 732#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 2620#(= ~res2~0 ~res1~0), Black: 720#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 966#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 532#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 942#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3222#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3790#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 1527#(= ~res2~0 ~res1~0), Black: 1016#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 934#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 4208#true, Black: 4261#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 359#true, Black: 825#(and (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~M~0 0)), Black: 2066#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3400#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3621#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 4039#true, Black: 2370#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1987#(or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 936#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0) (= ~M~0 0)), 1342#true, Black: 3190#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 0)) (or (and (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (< 0 (+ ~A~0.offset 1)) (< 3 (+ (* ~N~0 4) ~A~0.offset))) (or (< ~A~0.offset 1) (< (+ 3 ~A~0.offset) (* ~N~0 4)))) (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)))), Black: 1924#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4393#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 1516#true, Black: 4094#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 2885#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3251#(or (= ~res2~0 ~res1~0) (< 0 ~M~0)), Black: 2981#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 194#(= ~res2~0 ~res1~0), Black: 349#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3224#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 43#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 2775#true, Black: 968#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~res1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3832#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 2929#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 674#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4035#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 948#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 3008#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), Black: 728#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 484#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 736#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 4203#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 2444#(= ~res2~0 ~res1~0), Black: 540#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 1336#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 366#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1511#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 244#(and (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2971#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 2412#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1352#(= ~res2~0 ~res1~0), 2256#true, Black: 818#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2977#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3160#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3820#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1499#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 2433#true, Black: 2955#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3243#true, Black: 1322#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 536#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1857#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 4049#(= ~res2~0 ~res1~0), Black: 3613#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3009#(= ~res2~0 ~res1~0), Black: 4403#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3356#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2963#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1178#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1676#true, Black: 1878#(= ~res2~0 ~res1~0), Black: 4381#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 546#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 716#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 524#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 829#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 2404#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 1013#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= ~M~0 0)), Black: 3632#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0)))), Black: 3166#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 0 ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 1 ~N~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (< 1 ~N~0)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1274#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 3869#(= ~res2~0 ~res1~0), Black: 960#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= ~M~0 0)), Black: 2406#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4401#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 512#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 3840#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~B~0.offset 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))))) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)))), Black: 926#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) 0)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 772#(= ~res2~0 ~res1~0), Black: 516#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2100#(= ~res2~0 ~res1~0), Black: 718#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 762#true, 4425#(<= ~N~0 1), 1867#true]) [2025-04-13 20:34:53,452 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:34:53,452 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:34:53,452 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-13 20:34:53,452 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:34:53,453 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L66-1-->L66: Formula: (let ((.cse4 (* |v_thread3Thread1of1ForFork0_~i~2#1_8| 4))) (let ((.cse0 (select (select |v_#memory_int#1_161| v_~B~0.base_182) (+ v_~B~0.offset_182 .cse4))) (.cse2 (select (select |v_#memory_int#1_161| v_~A~0.base_202) (+ v_~A~0.offset_202 .cse4)))) (let ((.cse1 (<= 0 (+ .cse0 .cse2 2147483648))) (.cse3 (<= (+ .cse0 .cse2) 2147483647))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_8| v_~N~0_184) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_3| v_~res2~0_129) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_3| 2147483647)) 1 0) 0)) (not (= (ite (or (<= v_~res2~0_129 |v_thread3Thread1of1ForFork0_plus_#res#1_3|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_3| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_8| (+ |v_thread3Thread1of1ForFork0_~i~2#1_7| 1)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_3| (+ .cse0 v_~res2~0_129 .cse2)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_3| |v_thread3Thread1of1ForFork0_~tmp~1#1_7|) (<= |v_thread3Thread1of1ForFork0_~tmp~1#1_7| 2147483647) (not (= (ite (or (<= .cse0 0) .cse3) 1 0) 0)) .cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_~tmp~1#1_7| 2147483648)) .cse3)))) InVars {~A~0.base=v_~A~0.base_202, ~B~0.base=v_~B~0.base_182, ~A~0.offset=v_~A~0.offset_202, ~N~0=v_~N~0_184, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_7|, #memory_int#1=|v_#memory_int#1_161|, ~B~0.offset=v_~B~0.offset_182, ~res2~0=v_~res2~0_129} OutVars{~A~0.base=v_~A~0.base_202, thread3Thread1of1ForFork0_#t~ret13#1=|v_thread3Thread1of1ForFork0_#t~ret13#1_3|, thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_3|, ~B~0.base=v_~B~0.base_182, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~N~0=v_~N~0_184, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_3|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_8|, #memory_int#1=|v_#memory_int#1_161|, thread3Thread1of1ForFork0_#t~mem11#1=|v_thread3Thread1of1ForFork0_#t~mem11#1_3|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_3|, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_3|, ~A~0.offset=v_~A~0.offset_202, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_3|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_3|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_3|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_3|, ~B~0.offset=v_~B~0.offset_182, ~res2~0=v_~res2~0_129} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~ret13#1, thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_~tmp~1#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem11#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_plus_~b#1][525], [Black: 2889#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1351#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 952#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 4048#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3108#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 2998#true, Black: 2366#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2265#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2830#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3352#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1730#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3838#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 180#(and (<= 1 ~N~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), Black: 2422#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3305#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 1833#(and (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))), Black: 2068#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3814#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))))), Black: 744#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2771#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3743#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3412#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 617#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 1006#true, Black: 4219#(= ~res2~0 ~res1~0), Black: 2605#(and (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3804#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 962#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0)) (= ~M~0 0)), Black: 958#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3422#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 514#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 916#(and (= ~A~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), 1169#true, Black: 3868#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 182#true, 40#(< ~M~0 ~N~0), Black: 3426#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 1781#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 2056#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3196#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 2672#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 3626#true, 560#true, Black: 3184#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1162#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 544#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 3448#true, Black: 924#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), Black: 1179#(= ~res2~0 ~res1~0), Black: 3432#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0)), 2089#true, Black: 2874#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 1789#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4377#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1853#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3180#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 347#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 1017#(= ~res2~0 ~res1~0), Black: 3172#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3457#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 7#thread2EXITtrue, Black: 4273#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 4385#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ ~res2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1932#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 1774#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), 8#L87-1true, Black: 3200#(and (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (< 0 ~M~0))), Black: 2052#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3115#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3458#(= ~res2~0 ~res1~0), Black: 2266#(= ~res2~0 ~res1~0), Black: 2957#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3218#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 464#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 528#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3859#true, Black: 938#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 2608#true, Black: 748#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3739#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 732#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 2620#(= ~res2~0 ~res1~0), Black: 720#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 966#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 532#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 942#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3222#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3790#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 1527#(= ~res2~0 ~res1~0), Black: 1016#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 934#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 4208#true, Black: 4261#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 359#true, Black: 825#(and (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~M~0 0)), Black: 2066#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3400#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3621#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 4039#true, Black: 2370#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1987#(or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 936#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0) (= ~M~0 0)), 1342#true, Black: 3190#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 0)) (or (and (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (< 0 (+ ~A~0.offset 1)) (< 3 (+ (* ~N~0 4) ~A~0.offset))) (or (< ~A~0.offset 1) (< (+ 3 ~A~0.offset) (* ~N~0 4)))) (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)))), Black: 1924#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4393#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 1516#true, Black: 4094#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 2885#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3251#(or (= ~res2~0 ~res1~0) (< 0 ~M~0)), Black: 2981#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 194#(= ~res2~0 ~res1~0), Black: 349#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3224#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 43#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 2775#true, Black: 968#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~res1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3832#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 2929#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 674#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4035#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 948#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 3008#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), Black: 728#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 484#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 736#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 4203#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 2444#(= ~res2~0 ~res1~0), Black: 540#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 1336#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 366#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1511#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 244#(and (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2971#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 2412#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1352#(= ~res2~0 ~res1~0), 2256#true, Black: 818#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2977#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3160#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3820#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1499#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 2433#true, Black: 2955#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3243#true, Black: 1322#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 536#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1857#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 4049#(= ~res2~0 ~res1~0), Black: 3613#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3009#(= ~res2~0 ~res1~0), Black: 4403#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3356#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2963#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1178#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1676#true, 29#L66true, Black: 1878#(= ~res2~0 ~res1~0), Black: 4381#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 546#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 716#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 524#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 829#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 2404#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 1013#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= ~M~0 0)), Black: 3632#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0)))), Black: 3166#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 0 ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 1 ~N~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (< 1 ~N~0)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1274#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 3869#(= ~res2~0 ~res1~0), Black: 960#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= ~M~0 0)), Black: 2406#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4401#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 512#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 3840#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~B~0.offset 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))))) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)))), Black: 926#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) 0)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 772#(= ~res2~0 ~res1~0), Black: 516#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2100#(= ~res2~0 ~res1~0), Black: 718#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 762#true, 4425#(<= ~N~0 1), 1867#true]) [2025-04-13 20:34:53,454 INFO L286 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-04-13 20:34:53,454 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:34:53,454 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-13 20:34:53,454 INFO L289 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2025-04-13 20:34:54,498 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([840] L66-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.base_3| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_3| 0) (<= v_~N~0_182 (+ |v_thread3Thread1of1ForFork0_~i~2#1_5| 1))) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_5|, ~N~0=v_~N~0_182} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_3|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_3|, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_1|, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_5|, ~N~0=v_~N~0_182} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_~tmp~1#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_~i~2#1][524], [Black: 2889#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1351#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 952#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 4048#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3108#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 2998#true, Black: 2366#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2265#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2830#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3352#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1730#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3838#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 180#(and (<= 1 ~N~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), Black: 2422#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3305#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 1833#(and (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))), Black: 2068#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3814#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))))), Black: 744#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2771#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3743#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3412#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 617#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 1006#true, Black: 4219#(= ~res2~0 ~res1~0), Black: 2605#(and (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3804#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 962#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0)) (= ~M~0 0)), Black: 958#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3422#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 514#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 916#(and (= ~A~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), 1169#true, Black: 3868#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 10#thread3EXITtrue, 182#true, 40#(< ~M~0 ~N~0), Black: 3426#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 1781#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 2056#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3196#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 2672#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 3626#true, 560#true, Black: 3184#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1162#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 544#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 3448#true, Black: 924#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), Black: 1179#(= ~res2~0 ~res1~0), Black: 3432#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0)), 2089#true, Black: 2874#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 1789#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4377#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1853#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3180#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 347#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 1017#(= ~res2~0 ~res1~0), Black: 3172#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3457#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 4273#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 4385#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ ~res2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1932#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 1774#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 3200#(and (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (< 0 ~M~0))), Black: 2052#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3115#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3458#(= ~res2~0 ~res1~0), Black: 2266#(= ~res2~0 ~res1~0), Black: 2957#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3218#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 464#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 528#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3859#true, Black: 938#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 2608#true, Black: 748#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3739#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 732#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 2620#(= ~res2~0 ~res1~0), Black: 720#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 966#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 532#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 942#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3222#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3790#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 1527#(= ~res2~0 ~res1~0), Black: 1016#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 934#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 4208#true, Black: 4261#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 359#true, Black: 825#(and (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~M~0 0)), Black: 2066#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3400#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3621#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 4039#true, Black: 2370#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1987#(or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 936#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0) (= ~M~0 0)), 1342#true, Black: 3190#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 0)) (or (and (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (< 0 (+ ~A~0.offset 1)) (< 3 (+ (* ~N~0 4) ~A~0.offset))) (or (< ~A~0.offset 1) (< (+ 3 ~A~0.offset) (* ~N~0 4)))) (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)))), Black: 1924#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4393#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 1516#true, Black: 4094#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 2885#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3251#(or (= ~res2~0 ~res1~0) (< 0 ~M~0)), Black: 2981#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 194#(= ~res2~0 ~res1~0), Black: 349#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3224#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 43#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 2775#true, Black: 968#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~res1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3832#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 2929#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), 26#L88true, Black: 674#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4035#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 948#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 3008#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), Black: 728#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 484#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 736#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 4203#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 2444#(= ~res2~0 ~res1~0), Black: 540#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 1336#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 366#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1511#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 244#(and (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2971#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 2412#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1352#(= ~res2~0 ~res1~0), 2256#true, Black: 818#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2977#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3160#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3820#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1499#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 2433#true, Black: 2955#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3243#true, Black: 1322#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 536#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1857#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 4049#(= ~res2~0 ~res1~0), Black: 3613#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3009#(= ~res2~0 ~res1~0), Black: 4403#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3356#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2963#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1178#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1676#true, Black: 1878#(= ~res2~0 ~res1~0), Black: 4381#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 546#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 716#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 524#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 829#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 2404#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 1013#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= ~M~0 0)), Black: 3632#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0)))), Black: 3166#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 0 ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 1 ~N~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (< 1 ~N~0)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1274#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 3869#(= ~res2~0 ~res1~0), Black: 960#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= ~M~0 0)), Black: 2406#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4401#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 512#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 3840#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~B~0.offset 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))))) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)))), Black: 926#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) 0)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 772#(= ~res2~0 ~res1~0), Black: 516#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2100#(= ~res2~0 ~res1~0), Black: 718#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 762#true, 4425#(<= ~N~0 1), 1867#true]) [2025-04-13 20:34:54,499 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-13 20:34:54,499 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-13 20:34:54,499 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-13 20:34:54,499 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-04-13 20:34:54,499 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L66-1-->L66: Formula: (let ((.cse4 (* |v_thread3Thread1of1ForFork0_~i~2#1_8| 4))) (let ((.cse0 (select (select |v_#memory_int#1_161| v_~B~0.base_182) (+ v_~B~0.offset_182 .cse4))) (.cse2 (select (select |v_#memory_int#1_161| v_~A~0.base_202) (+ v_~A~0.offset_202 .cse4)))) (let ((.cse1 (<= 0 (+ .cse0 .cse2 2147483648))) (.cse3 (<= (+ .cse0 .cse2) 2147483647))) (and (< |v_thread3Thread1of1ForFork0_~i~2#1_8| v_~N~0_184) (not (= (ite (or (<= 0 .cse0) .cse1) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_3| v_~res2~0_129) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_3| 2147483647)) 1 0) 0)) (not (= (ite (or (<= v_~res2~0_129 |v_thread3Thread1of1ForFork0_plus_#res#1_3|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_3| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork0_~i~2#1_8| (+ |v_thread3Thread1of1ForFork0_~i~2#1_7| 1)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_3| (+ .cse0 v_~res2~0_129 .cse2)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_3| |v_thread3Thread1of1ForFork0_~tmp~1#1_7|) (<= |v_thread3Thread1of1ForFork0_~tmp~1#1_7| 2147483647) (not (= (ite (or (<= .cse0 0) .cse3) 1 0) 0)) .cse1 (<= 0 (+ |v_thread3Thread1of1ForFork0_~tmp~1#1_7| 2147483648)) .cse3)))) InVars {~A~0.base=v_~A~0.base_202, ~B~0.base=v_~B~0.base_182, ~A~0.offset=v_~A~0.offset_202, ~N~0=v_~N~0_184, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_7|, #memory_int#1=|v_#memory_int#1_161|, ~B~0.offset=v_~B~0.offset_182, ~res2~0=v_~res2~0_129} OutVars{~A~0.base=v_~A~0.base_202, thread3Thread1of1ForFork0_#t~ret13#1=|v_thread3Thread1of1ForFork0_#t~ret13#1_3|, thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_3|, ~B~0.base=v_~B~0.base_182, thread3Thread1of1ForFork0_~tmp~1#1=|v_thread3Thread1of1ForFork0_~tmp~1#1_7|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~N~0=v_~N~0_184, thread3Thread1of1ForFork0_#t~ret14#1=|v_thread3Thread1of1ForFork0_#t~ret14#1_3|, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_8|, #memory_int#1=|v_#memory_int#1_161|, thread3Thread1of1ForFork0_#t~mem11#1=|v_thread3Thread1of1ForFork0_#t~mem11#1_3|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_3|, thread3Thread1of1ForFork0_#t~post15#1=|v_thread3Thread1of1ForFork0_#t~post15#1_3|, ~A~0.offset=v_~A~0.offset_202, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_3|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_3|, thread3Thread1of1ForFork0_#t~mem12#1=|v_thread3Thread1of1ForFork0_#t~mem12#1_3|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_3|, ~B~0.offset=v_~B~0.offset_182, ~res2~0=v_~res2~0_129} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~ret13#1, thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_~tmp~1#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~ret14#1, thread3Thread1of1ForFork0_~i~2#1, thread3Thread1of1ForFork0_#t~mem11#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_#t~post15#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~mem12#1, thread3Thread1of1ForFork0_plus_~b#1][525], [Black: 2889#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1351#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 952#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 4048#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3108#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), 2998#true, Black: 2366#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2265#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2830#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3352#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1730#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3838#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 180#(and (<= 1 ~N~0) (<= (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)), Black: 2422#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3305#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0)))), Black: 1833#(and (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))), Black: 2068#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3814#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))))), Black: 744#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2771#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3743#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3412#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 617#(and (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 1006#true, Black: 4219#(= ~res2~0 ~res1~0), Black: 2605#(and (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3804#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 962#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0)) (= ~M~0 0)), Black: 958#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3422#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 514#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 916#(and (= ~A~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), 1169#true, Black: 3868#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 182#true, 40#(< ~M~0 ~N~0), Black: 3426#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (= ~res2~0 0) (not (= ~M~0 0)))), Black: 1781#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 2056#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3196#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 2672#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), 3626#true, 560#true, Black: 3184#(and (or (= (+ (select (select |#memory_int#1| ~B~0.base) 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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1162#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 544#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|)) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), 3448#true, Black: 924#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), Black: 1179#(= ~res2~0 ~res1~0), Black: 3432#(and (<= 0 ~M~0) (= ~res2~0 ~res1~0)), 2089#true, Black: 2874#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 1789#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4377#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1853#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3180#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (and (= ~A~0.offset 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (< 1 ~N~0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 347#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 1017#(= ~res2~0 ~res1~0), Black: 3172#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3457#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 4273#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 4385#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ ~res2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4)))) (< 0 ~M~0)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1932#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 343#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 1774#(or (< 0 ~M~0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 3200#(and (<= 0 ~M~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (< 0 ~M~0)) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (or (= (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (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))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))))) (< 0 ~M~0))), Black: 2052#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3115#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3458#(= ~res2~0 ~res1~0), Black: 2266#(= ~res2~0 ~res1~0), Black: 2957#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3218#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 464#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 528#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3859#true, Black: 938#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 2608#true, Black: 748#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 3739#(or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 732#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 2620#(= ~res2~0 ~res1~0), Black: 720#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 966#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 532#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 942#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3222#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3790#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 1527#(= ~res2~0 ~res1~0), Black: 1016#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 934#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0)), 4208#true, Black: 4261#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 359#true, Black: 825#(and (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (= ~M~0 0)), Black: 2066#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3400#(and (<= 0 ~M~0) (or (= ~res2~0 ~res1~0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3621#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 4039#true, Black: 2370#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 1987#(or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 936#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= ~res2~0 0) (= ~M~0 0)), 1342#true, Black: 3190#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 0)) (or (and (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) |thread3Thread1of1ForFork0_~tmp~1#1|) (or (< 0 (+ ~A~0.offset 1)) (< 3 (+ (* ~N~0 4) ~A~0.offset))) (or (< ~A~0.offset 1) (< (+ 3 ~A~0.offset) (* ~N~0 4)))) (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)))), Black: 1924#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4393#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), 1516#true, Black: 4094#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))), Black: 2885#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 3251#(or (= ~res2~0 ~res1~0) (< 0 ~M~0)), Black: 2981#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 194#(= ~res2~0 ~res1~0), Black: 349#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 3224#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 43#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 2775#true, Black: 968#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (< 0 ~M~0) (= ~res1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3832#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res2~0 ~res1~0)), Black: 2929#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), 26#L88true, Black: 674#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 4035#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 948#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (= ~M~0 0)), Black: 3008#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), Black: 728#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 484#(or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0))), Black: 736#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 4203#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 2444#(= ~res2~0 ~res1~0), Black: 540#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 1336#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 366#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1511#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 244#(and (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2971#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 2412#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1352#(= ~res2~0 ~res1~0), 2256#true, Black: 818#(and (<= 0 ~M~0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2977#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 3160#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))))), Black: 3820#(and (<= 0 ~M~0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))))), Black: 1499#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 2433#true, Black: 2955#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 3243#true, Black: 1322#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 536#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (= |thread3Thread1of1ForFork0_~tmp~1#1| 0) (not (= ~M~0 0))) (or (< 0 ~M~0) (= ~res2~0 0)) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1857#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (or (< 0 ~M~0) (= ~res2~0 0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0)), Black: 4049#(= ~res2~0 ~res1~0), Black: 3613#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3009#(= ~res2~0 ~res1~0), Black: 4403#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 3356#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 2963#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (or (< 0 ~M~0) (= ~res2~0 0)) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)))) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) ~res2~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1178#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1676#true, 29#L66true, Black: 1878#(= ~res2~0 ~res1~0), Black: 4381#(and (<= 0 ~M~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~B~0.base) (+ ~B~0.offset (* ~M~0 4)))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 546#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= ~M~0 0))), Black: 716#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 524#(and (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 |thread1Thread1of1ForFork1_~i~0#1|))) (or (< 0 ~M~0) (= ~M~0 0))), Black: 829#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|), Black: 2404#(and (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (or (< 0 ~M~0) (and (= ~res2~0 ~res1~0) (= ~M~0 0)))), Black: 1013#(and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= ~M~0 0)), Black: 3632#(and (= ~B~0.offset 0) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|) (= ~res1~0 0)))), Black: 3166#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 0 ~M~0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0)) (<= 1 ~N~0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (or (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (< 1 ~N~0)) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 1274#(or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))), Black: 3869#(= ~res2~0 ~res1~0), Black: 960#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|))) (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) 0) (= ~res2~0 0) (= ~M~0 0)), Black: 2406#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 4401#(and (= ~res2~0 ~res1~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ ~res1~0 (select (select |#memory_int#1| ~B~0.base) ~B~0.offset) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|)), Black: 512#(and (<= 0 ~M~0) (or (< 0 ~M~0) (= |thread3Thread1of1ForFork0_~tmp~1#1| (+ (select (select |#memory_int#1| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) ~res1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))))) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 3840#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (= ~B~0.offset 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (and (= ~A~0.offset 0) (= ~res1~0 0) (= ~res2~0 (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0))))) (or (= |thread3Thread1of1ForFork0_~i~2#1| 0) (and (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0)))), Black: 926#(and (or (< 0 ~M~0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) 0)) (or (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) (+ (select (select |#memory_int#1| ~B~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)) (select (select |#memory_int#1| ~A~0.base) (* 4 |thread1Thread1of1ForFork1_~i~0#1|)))) (< 0 ~M~0)) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 772#(= ~res2~0 ~res1~0), Black: 516#(and (or (= ~res2~0 ~res1~0) (< 0 ~M~0)) (<= 0 ~M~0) (or (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~1#1|) (not (= ~M~0 0)))), Black: 2100#(= ~res2~0 ~res1~0), Black: 718#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (or (and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#1| ~B~0.base) 0) (select (select |#memory_int#1| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~1#1|)) (and (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= |thread3Thread1of1ForFork0_~i~2#1| ~M~0))) (= ~res1~0 0) (= ~res2~0 0) (= (+ (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4)) (select (select |#memory_int#1| ~B~0.base) (* ~M~0 4))) |thread3Thread1of1ForFork0_~tmp~1#1|)), 762#true, 4425#(<= ~N~0 1), 1867#true]) [2025-04-13 20:34:54,499 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-04-13 20:34:54,499 INFO L289 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-04-13 20:34:54,499 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-13 20:34:54,499 INFO L289 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2025-04-13 20:34:55,317 INFO L116 PetriNetUnfolderBase]: 24689/36989 cut-off events. [2025-04-13 20:34:55,317 INFO L117 PetriNetUnfolderBase]: For 779493/783866 co-relation queries the response was YES. [2025-04-13 20:34:56,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370039 conditions, 36989 events. 24689/36989 cut-off events. For 779493/783866 co-relation queries the response was YES. Maximal size of possible extension queue 2868. Compared 279389 event pairs, 6106 based on Foata normal form. 3315/31731 useless extension candidates. Maximal degree in co-relation 369549. Up to 13515 conditions per place. [2025-04-13 20:34:56,670 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 2258 selfloop transitions, 426 changer transitions 103/3757 dead transitions. [2025-04-13 20:34:56,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 3757 transitions, 97117 flow [2025-04-13 20:34:56,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:34:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:34:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2025-04-13 20:34:56,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.409375 [2025-04-13 20:34:56,672 INFO L175 Difference]: Start difference. First operand has 573 places, 2848 transitions, 70528 flow. Second operand 10 states and 131 transitions. [2025-04-13 20:34:56,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 3757 transitions, 97117 flow [2025-04-13 20:35:16,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 3757 transitions, 96290 flow, removed 221 selfloop flow, removed 8 redundant places. [2025-04-13 20:35:16,710 INFO L231 Difference]: Finished difference. Result has 578 places, 2788 transitions, 72008 flow [2025-04-13 20:35:16,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=63507, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=72008, PETRI_PLACES=578, PETRI_TRANSITIONS=2788} [2025-04-13 20:35:16,712 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 547 predicate places. [2025-04-13 20:35:16,712 INFO L485 AbstractCegarLoop]: Abstraction has has 578 places, 2788 transitions, 72008 flow [2025-04-13 20:35:16,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 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-04-13 20:35:16,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:16,713 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] [2025-04-13 20:35:16,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:35:16,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:35:16,913 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:16,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:16,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1143315869, now seen corresponding path program 24 times [2025-04-13 20:35:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:16,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273064467] [2025-04-13 20:35:16,914 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:35:16,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:16,920 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:35:16,924 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:35:16,924 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:35:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:35:16,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:16,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273064467] [2025-04-13 20:35:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273064467] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:16,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040783533] [2025-04-13 20:35:16,973 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:35:16,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:35:16,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:35:16,974 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:35:16,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 20:35:17,028 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:35:17,045 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:35:17,045 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:35:17,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:17,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:35:17,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:35:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:35:17,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:35:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:35:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040783533] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:35:17,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:35:17,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 15 [2025-04-13 20:35:17,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421900824] [2025-04-13 20:35:17,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:17,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:35:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:17,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:35:17,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:35:17,130 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:35:17,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 2788 transitions, 72008 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-04-13 20:35:17,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:17,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:35:17,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:40,073 INFO L116 PetriNetUnfolderBase]: 35504/53772 cut-off events. [2025-04-13 20:35:40,073 INFO L117 PetriNetUnfolderBase]: For 1194083/1198531 co-relation queries the response was YES. [2025-04-13 20:35:42,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550804 conditions, 53772 events. 35504/53772 cut-off events. For 1194083/1198531 co-relation queries the response was YES. Maximal size of possible extension queue 4210. Compared 434679 event pairs, 8132 based on Foata normal form. 1649/42830 useless extension candidates. Maximal degree in co-relation 550338. Up to 19077 conditions per place. [2025-04-13 20:35:42,960 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 2218 selfloop transitions, 638 changer transitions 8/3834 dead transitions. [2025-04-13 20:35:42,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 3834 transitions, 105331 flow [2025-04-13 20:35:42,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:35:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:35:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2025-04-13 20:35:42,961 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51953125 [2025-04-13 20:35:42,961 INFO L175 Difference]: Start difference. First operand has 578 places, 2788 transitions, 72008 flow. Second operand 8 states and 133 transitions. [2025-04-13 20:35:42,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 3834 transitions, 105331 flow [2025-04-13 20:36:30,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 3834 transitions, 105124 flow, removed 81 selfloop flow, removed 7 redundant places. [2025-04-13 20:36:30,934 INFO L231 Difference]: Finished difference. Result has 583 places, 3114 transitions, 83579 flow [2025-04-13 20:36:30,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=71480, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=83579, PETRI_PLACES=583, PETRI_TRANSITIONS=3114} [2025-04-13 20:36:30,936 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 552 predicate places. [2025-04-13 20:36:30,937 INFO L485 AbstractCegarLoop]: Abstraction has has 583 places, 3114 transitions, 83579 flow [2025-04-13 20:36:30,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-04-13 20:36:30,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:30,937 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] [2025-04-13 20:36:30,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 20:36:31,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:36:31,137 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:31,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash -607504879, now seen corresponding path program 25 times [2025-04-13 20:36:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:31,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485821540] [2025-04-13 20:36:31,138 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:36:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:31,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:36:31,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:36:31,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:31,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:31,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485821540] [2025-04-13 20:36:31,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485821540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:31,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577846556] [2025-04-13 20:36:31,201 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:36:31,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:31,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:31,203 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:36:31,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 20:36:31,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:36:31,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:36:31,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:36:31,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:31,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 20:36:31,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:31,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:31,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577846556] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:36:31,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:36:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-04-13 20:36:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488595587] [2025-04-13 20:36:31,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:36:31,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:36:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:31,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:36:31,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:36:31,333 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:36:31,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 3114 transitions, 83579 flow. Second operand has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 14 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:31,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:31,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:36:31,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:53,288 INFO L116 PetriNetUnfolderBase]: 31539/47723 cut-off events. [2025-04-13 20:36:53,289 INFO L117 PetriNetUnfolderBase]: For 1330611/1335982 co-relation queries the response was YES. [2025-04-13 20:36:55,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501902 conditions, 47723 events. 31539/47723 cut-off events. For 1330611/1335982 co-relation queries the response was YES. Maximal size of possible extension queue 3410. Compared 379384 event pairs, 12777 based on Foata normal form. 1894/43124 useless extension candidates. Maximal degree in co-relation 501082. Up to 26490 conditions per place. [2025-04-13 20:36:55,471 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 2160 selfloop transitions, 10 changer transitions 11/3151 dead transitions. [2025-04-13 20:36:55,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 3151 transitions, 87590 flow [2025-04-13 20:36:55,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:36:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:36:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2025-04-13 20:36:55,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2025-04-13 20:36:55,472 INFO L175 Difference]: Start difference. First operand has 583 places, 3114 transitions, 83579 flow. Second operand 7 states and 89 transitions. [2025-04-13 20:36:55,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 3151 transitions, 87590 flow [2025-04-13 20:37:34,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 3151 transitions, 87374 flow, removed 104 selfloop flow, removed 3 redundant places. [2025-04-13 20:37:34,523 INFO L231 Difference]: Finished difference. Result has 585 places, 2992 transitions, 79220 flow [2025-04-13 20:37:34,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=79200, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2992, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=79220, PETRI_PLACES=585, PETRI_TRANSITIONS=2992} [2025-04-13 20:37:34,525 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 554 predicate places. [2025-04-13 20:37:34,525 INFO L485 AbstractCegarLoop]: Abstraction has has 585 places, 2992 transitions, 79220 flow [2025-04-13 20:37:34,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 14 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:34,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:34,526 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] [2025-04-13 20:37:34,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 20:37:34,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 20:37:34,726 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:34,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1465162005, now seen corresponding path program 1 times [2025-04-13 20:37:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:34,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325094885] [2025-04-13 20:37:34,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:34,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:37:34,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:37:34,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:34,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:34,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325094885] [2025-04-13 20:37:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325094885] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:34,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937402387] [2025-04-13 20:37:34,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:37:34,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:34,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:34,785 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:37:34,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 20:37:34,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:37:34,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:37:34,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:37:34,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:34,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:37:34,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:34,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:37:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937402387] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:34,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:34,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:37:34,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801010709] [2025-04-13 20:37:34,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:34,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 20:37:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:34,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 20:37:34,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:37:34,947 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:37:34,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 2992 transitions, 79220 flow. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:34,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:34,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:37:34,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:42,373 INFO L116 PetriNetUnfolderBase]: 10690/16330 cut-off events. [2025-04-13 20:37:42,374 INFO L117 PetriNetUnfolderBase]: For 515057/517445 co-relation queries the response was YES. [2025-04-13 20:37:42,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169204 conditions, 16330 events. 10690/16330 cut-off events. For 515057/517445 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 112727 event pairs, 3851 based on Foata normal form. 1208/15610 useless extension candidates. Maximal degree in co-relation 168775. Up to 12324 conditions per place. [2025-04-13 20:37:42,873 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 972 selfloop transitions, 6 changer transitions 155/1668 dead transitions. [2025-04-13 20:37:42,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 1668 transitions, 43093 flow [2025-04-13 20:37:42,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:37:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:37:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2025-04-13 20:37:42,874 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2025-04-13 20:37:42,874 INFO L175 Difference]: Start difference. First operand has 585 places, 2992 transitions, 79220 flow. Second operand 8 states and 98 transitions. [2025-04-13 20:37:42,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 1668 transitions, 43093 flow [2025-04-13 20:37:48,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 1668 transitions, 40700 flow, removed 893 selfloop flow, removed 34 redundant places. [2025-04-13 20:37:48,841 INFO L231 Difference]: Finished difference. Result has 514 places, 1513 transitions, 35231 flow [2025-04-13 20:37:48,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=37969, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=35231, PETRI_PLACES=514, PETRI_TRANSITIONS=1513} [2025-04-13 20:37:48,843 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 483 predicate places. [2025-04-13 20:37:48,843 INFO L485 AbstractCegarLoop]: Abstraction has has 514 places, 1513 transitions, 35231 flow [2025-04-13 20:37:48,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:48,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:48,843 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:48,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 20:37:49,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 20:37:49,044 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:49,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 293604547, now seen corresponding path program 26 times [2025-04-13 20:37:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:49,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751365951] [2025-04-13 20:37:49,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:37:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:49,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:37:49,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:37:49,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:49,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:49,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:49,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751365951] [2025-04-13 20:37:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751365951] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:49,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195742098] [2025-04-13 20:37:49,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:37:49,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:49,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:49,115 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:37:49,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 20:37:49,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:37:49,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:37:49,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:49,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:49,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:37:49,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:49,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:49,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195742098] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:49,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:37:49,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-04-13 20:37:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211879698] [2025-04-13 20:37:49,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:49,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:37:49,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:49,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:37:49,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:37:49,299 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:37:49,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 1513 transitions, 35231 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-04-13 20:37:49,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:49,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:37:49,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:53,637 INFO L116 PetriNetUnfolderBase]: 9992/14675 cut-off events. [2025-04-13 20:37:53,637 INFO L117 PetriNetUnfolderBase]: For 335565/337467 co-relation queries the response was YES. [2025-04-13 20:37:53,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144004 conditions, 14675 events. 9992/14675 cut-off events. For 335565/337467 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 93454 event pairs, 2470 based on Foata normal form. 440/13268 useless extension candidates. Maximal degree in co-relation 143807. Up to 10802 conditions per place. [2025-04-13 20:37:53,905 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 918 selfloop transitions, 103 changer transitions 0/1556 dead transitions. [2025-04-13 20:37:53,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1556 transitions, 38219 flow [2025-04-13 20:37:53,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:37:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:37:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-04-13 20:37:53,906 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2025-04-13 20:37:53,906 INFO L175 Difference]: Start difference. First operand has 514 places, 1513 transitions, 35231 flow. Second operand 7 states and 87 transitions. [2025-04-13 20:37:53,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 1556 transitions, 38219 flow [2025-04-13 20:37:57,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 1556 transitions, 37054 flow, removed 186 selfloop flow, removed 34 redundant places. [2025-04-13 20:37:57,410 INFO L231 Difference]: Finished difference. Result has 464 places, 1512 transitions, 34706 flow [2025-04-13 20:37:57,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33844, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=34706, PETRI_PLACES=464, PETRI_TRANSITIONS=1512} [2025-04-13 20:37:57,412 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 433 predicate places. [2025-04-13 20:37:57,412 INFO L485 AbstractCegarLoop]: Abstraction has has 464 places, 1512 transitions, 34706 flow [2025-04-13 20:37:57,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-04-13 20:37:57,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:57,412 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:37:57,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 20:37:57,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:57,613 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:57,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1448562847, now seen corresponding path program 27 times [2025-04-13 20:37:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:57,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690717444] [2025-04-13 20:37:57,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:37:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:57,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:37:57,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:37:57,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:37:57,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:57,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:57,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690717444] [2025-04-13 20:37:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690717444] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:57,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240062407] [2025-04-13 20:37:57,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:37:57,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:57,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:57,675 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:37:57,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 20:37:57,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 20:37:57,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:37:57,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:37:57,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:57,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:37:57,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:57,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:37:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240062407] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:57,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:37:57,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-04-13 20:37:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742187554] [2025-04-13 20:37:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:57,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:37:57,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:57,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:37:57,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:37:57,845 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:37:57,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 1512 transitions, 34706 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-04-13 20:37:57,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:57,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:37:57,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:01,739 INFO L116 PetriNetUnfolderBase]: 10015/14626 cut-off events. [2025-04-13 20:38:01,739 INFO L117 PetriNetUnfolderBase]: For 333593/335215 co-relation queries the response was YES. [2025-04-13 20:38:01,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142644 conditions, 14626 events. 10015/14626 cut-off events. For 333593/335215 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 92766 event pairs, 3319 based on Foata normal form. 412/13128 useless extension candidates. Maximal degree in co-relation 142463. Up to 11031 conditions per place. [2025-04-13 20:38:01,954 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 931 selfloop transitions, 51 changer transitions 0/1517 dead transitions. [2025-04-13 20:38:01,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 1517 transitions, 36591 flow [2025-04-13 20:38:01,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:38:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:38:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-04-13 20:38:01,955 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2025-04-13 20:38:01,955 INFO L175 Difference]: Start difference. First operand has 464 places, 1512 transitions, 34706 flow. Second operand 7 states and 83 transitions. [2025-04-13 20:38:01,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 1517 transitions, 36591 flow [2025-04-13 20:38:05,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 1517 transitions, 36023 flow, removed 277 selfloop flow, removed 6 redundant places. [2025-04-13 20:38:05,109 INFO L231 Difference]: Finished difference. Result has 466 places, 1495 transitions, 34003 flow [2025-04-13 20:38:05,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33791, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=34003, PETRI_PLACES=466, PETRI_TRANSITIONS=1495} [2025-04-13 20:38:05,111 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 435 predicate places. [2025-04-13 20:38:05,111 INFO L485 AbstractCegarLoop]: Abstraction has has 466 places, 1495 transitions, 34003 flow [2025-04-13 20:38:05,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-04-13 20:38:05,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:05,111 INFO L206 CegarLoopForPetriNet]: trace histogram [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-04-13 20:38:05,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 20:38:05,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:05,312 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:05,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1578376089, now seen corresponding path program 1 times [2025-04-13 20:38:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:05,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051030702] [2025-04-13 20:38:05,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:05,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:38:05,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:38:05,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:05,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:38:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:05,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051030702] [2025-04-13 20:38:05,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051030702] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:05,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364980648] [2025-04-13 20:38:05,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:05,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:05,379 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:05,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 20:38:05,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:38:05,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:38:05,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:05,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:05,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:38:05,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:38:05,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:38:05,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364980648] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:38:05,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:38:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-13 20:38:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928673273] [2025-04-13 20:38:05,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:38:05,537 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 20:38:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:05,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 20:38:05,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:38:05,537 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 20:38:05,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 1495 transitions, 34003 flow. Second operand has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:38:05,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:05,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 20:38:05,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:08,505 INFO L116 PetriNetUnfolderBase]: 7936/11465 cut-off events. [2025-04-13 20:38:08,506 INFO L117 PetriNetUnfolderBase]: For 266313/267179 co-relation queries the response was YES. [2025-04-13 20:38:08,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117178 conditions, 11465 events. 7936/11465 cut-off events. For 266313/267179 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 67642 event pairs, 1433 based on Foata normal form. 1087/11175 useless extension candidates. Maximal degree in co-relation 116997. Up to 5209 conditions per place. [2025-04-13 20:38:08,670 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 627 selfloop transitions, 425 changer transitions 0/1570 dead transitions. [2025-04-13 20:38:08,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 1570 transitions, 37909 flow [2025-04-13 20:38:08,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:38:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:38:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2025-04-13 20:38:08,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2025-04-13 20:38:08,671 INFO L175 Difference]: Start difference. First operand has 466 places, 1495 transitions, 34003 flow. Second operand 9 states and 100 transitions. [2025-04-13 20:38:08,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 1570 transitions, 37909 flow [2025-04-13 20:38:11,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 1570 transitions, 36768 flow, removed 474 selfloop flow, removed 7 redundant places. [2025-04-13 20:38:11,214 INFO L231 Difference]: Finished difference. Result has 466 places, 1490 transitions, 34181 flow [2025-04-13 20:38:11,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=32143, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=397, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1037, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=34181, PETRI_PLACES=466, PETRI_TRANSITIONS=1490} [2025-04-13 20:38:11,215 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 435 predicate places. [2025-04-13 20:38:11,215 INFO L485 AbstractCegarLoop]: Abstraction has has 466 places, 1490 transitions, 34181 flow [2025-04-13 20:38:11,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:38:11,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:11,215 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] [2025-04-13 20:38:11,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 20:38:11,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 20:38:11,416 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:11,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash 339274190, now seen corresponding path program 2 times [2025-04-13 20:38:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:11,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496069300] [2025-04-13 20:38:11,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:11,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:38:11,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:38:11,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:38:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:11,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496069300] [2025-04-13 20:38:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496069300] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:11,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995735567] [2025-04-13 20:38:11,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:11,882 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:11,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 20:38:11,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:38:11,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:38:11,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:11,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:11,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 20:38:11,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:12,129 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:12,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 20:38:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:38:12,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:12,332 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:12,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 304 [2025-04-13 20:38:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:38:14,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995735567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:38:14,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:38:14,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 8] total 23 [2025-04-13 20:38:14,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566555699] [2025-04-13 20:38:14,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:38:14,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:38:14,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:14,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:38:14,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:38:14,875 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:14,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 1490 transitions, 34181 flow. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 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-04-13 20:38:14,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:14,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:14,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:19,176 INFO L116 PetriNetUnfolderBase]: 10172/14482 cut-off events. [2025-04-13 20:38:19,177 INFO L117 PetriNetUnfolderBase]: For 246167/246167 co-relation queries the response was YES. [2025-04-13 20:38:19,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146672 conditions, 14482 events. 10172/14482 cut-off events. For 246167/246167 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 82323 event pairs, 1280 based on Foata normal form. 1/13495 useless extension candidates. Maximal degree in co-relation 146489. Up to 12935 conditions per place. [2025-04-13 20:38:19,376 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1488 selfloop transitions, 253 changer transitions 1/1742 dead transitions. [2025-04-13 20:38:19,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 1742 transitions, 43027 flow [2025-04-13 20:38:19,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:38:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:38:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 191 transitions. [2025-04-13 20:38:19,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.373046875 [2025-04-13 20:38:19,378 INFO L175 Difference]: Start difference. First operand has 466 places, 1490 transitions, 34181 flow. Second operand 16 states and 191 transitions. [2025-04-13 20:38:19,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 1742 transitions, 43027 flow [2025-04-13 20:38:23,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 1742 transitions, 42181 flow, removed 183 selfloop flow, removed 8 redundant places. [2025-04-13 20:38:23,304 INFO L231 Difference]: Finished difference. Result has 479 places, 1585 transitions, 36539 flow [2025-04-13 20:38:23,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33355, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=36539, PETRI_PLACES=479, PETRI_TRANSITIONS=1585} [2025-04-13 20:38:23,306 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 448 predicate places. [2025-04-13 20:38:23,306 INFO L485 AbstractCegarLoop]: Abstraction has has 479 places, 1585 transitions, 36539 flow [2025-04-13 20:38:23,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 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-04-13 20:38:23,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:23,306 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] [2025-04-13 20:38:23,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-13 20:38:23,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:23,507 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:23,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash 573167834, now seen corresponding path program 3 times [2025-04-13 20:38:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:23,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524420276] [2025-04-13 20:38:23,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:38:23,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:23,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:38:23,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:38:23,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:38:23,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:38:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:23,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524420276] [2025-04-13 20:38:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524420276] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:23,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427374229] [2025-04-13 20:38:23,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:38:23,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:23,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:23,908 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:23,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 20:38:23,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:38:23,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:38:23,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:38:23,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:23,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-13 20:38:24,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:24,054 INFO L354 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-04-13 20:38:24,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:38:24,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:38:24,263 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 20:38:24,263 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 59 [2025-04-13 20:38:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:38:24,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:38:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427374229] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:38:24,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:38:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 10] total 30 [2025-04-13 20:38:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453406029] [2025-04-13 20:38:24,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:38:24,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:38:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:24,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:38:24,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:38:24,594 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:24,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 1585 transitions, 36539 flow. Second operand has 32 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 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-04-13 20:38:24,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:24,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:24,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:31,753 INFO L116 PetriNetUnfolderBase]: 12329/17639 cut-off events. [2025-04-13 20:38:31,753 INFO L117 PetriNetUnfolderBase]: For 318928/318928 co-relation queries the response was YES. [2025-04-13 20:38:31,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179477 conditions, 17639 events. 12329/17639 cut-off events. For 318928/318928 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 104342 event pairs, 1678 based on Foata normal form. 1/16536 useless extension candidates. Maximal degree in co-relation 179290. Up to 14537 conditions per place. [2025-04-13 20:38:32,024 INFO L140 encePairwiseOnDemand]: 13/32 looper letters, 1473 selfloop transitions, 708 changer transitions 3/2184 dead transitions. [2025-04-13 20:38:32,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 2184 transitions, 51913 flow [2025-04-13 20:38:32,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:38:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:38:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 491 transitions. [2025-04-13 20:38:32,025 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3196614583333333 [2025-04-13 20:38:32,025 INFO L175 Difference]: Start difference. First operand has 479 places, 1585 transitions, 36539 flow. Second operand 48 states and 491 transitions. [2025-04-13 20:38:32,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 2184 transitions, 51913 flow [2025-04-13 20:38:36,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 2184 transitions, 51453 flow, removed 122 selfloop flow, removed 6 redundant places. [2025-04-13 20:38:37,007 INFO L231 Difference]: Finished difference. Result has 547 places, 1960 transitions, 47395 flow [2025-04-13 20:38:37,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=36157, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=400, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1083, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=47395, PETRI_PLACES=547, PETRI_TRANSITIONS=1960} [2025-04-13 20:38:37,009 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 516 predicate places. [2025-04-13 20:38:37,009 INFO L485 AbstractCegarLoop]: Abstraction has has 547 places, 1960 transitions, 47395 flow [2025-04-13 20:38:37,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.875) internal successors, (156), 32 states have internal predecessors, (156), 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-04-13 20:38:37,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:37,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] [2025-04-13 20:38:37,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 20:38:37,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:37,210 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:37,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1782044230, now seen corresponding path program 4 times [2025-04-13 20:38:37,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:37,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73841710] [2025-04-13 20:38:37,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:38:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:37,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:38:37,231 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:38:37,231 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:38:37,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:38:37,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:37,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73841710] [2025-04-13 20:38:37,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73841710] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:37,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816153723] [2025-04-13 20:38:37,731 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:38:37,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:37,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:37,732 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:37,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 20:38:37,796 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:38:37,819 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:38:37,819 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:38:37,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:37,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-04-13 20:38:37,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:37,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:38:37,863 INFO L354 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-04-13 20:38:37,886 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 20:38:37,886 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 20:38:37,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 20:38:37,940 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-04-13 20:38:38,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:38:38,156 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:38,156 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 31 [2025-04-13 20:38:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:38,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:38:38,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816153723] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:38:38,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:38:38,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 9] total 33 [2025-04-13 20:38:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798892101] [2025-04-13 20:38:38,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:38:38,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:38:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:38,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:38:38,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:38:38,347 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:38,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 1960 transitions, 47395 flow. Second operand has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 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-04-13 20:38:38,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:38,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:38,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:47,549 INFO L116 PetriNetUnfolderBase]: 16163/23205 cut-off events. [2025-04-13 20:38:47,549 INFO L117 PetriNetUnfolderBase]: For 529702/529702 co-relation queries the response was YES. [2025-04-13 20:38:47,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265050 conditions, 23205 events. 16163/23205 cut-off events. For 529702/529702 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 142194 event pairs, 1769 based on Foata normal form. 4/21653 useless extension candidates. Maximal degree in co-relation 264835. Up to 17399 conditions per place. [2025-04-13 20:38:47,996 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 1788 selfloop transitions, 817 changer transitions 4/2609 dead transitions. [2025-04-13 20:38:47,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 2609 transitions, 66684 flow [2025-04-13 20:38:47,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 20:38:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-13 20:38:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 443 transitions. [2025-04-13 20:38:47,998 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36430921052631576 [2025-04-13 20:38:47,998 INFO L175 Difference]: Start difference. First operand has 547 places, 1960 transitions, 47395 flow. Second operand 38 states and 443 transitions. [2025-04-13 20:38:47,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 2609 transitions, 66684 flow [2025-04-13 20:38:58,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 2609 transitions, 65222 flow, removed 606 selfloop flow, removed 8 redundant places. [2025-04-13 20:38:58,138 INFO L231 Difference]: Finished difference. Result has 591 places, 2369 transitions, 59654 flow [2025-04-13 20:38:58,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=46253, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=457, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=59654, PETRI_PLACES=591, PETRI_TRANSITIONS=2369} [2025-04-13 20:38:58,140 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 560 predicate places. [2025-04-13 20:38:58,140 INFO L485 AbstractCegarLoop]: Abstraction has has 591 places, 2369 transitions, 59654 flow [2025-04-13 20:38:58,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 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-04-13 20:38:58,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:58,140 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] [2025-04-13 20:38:58,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 20:38:58,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 20:38:58,341 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:58,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1618198418, now seen corresponding path program 2 times [2025-04-13 20:38:58,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:58,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11776414] [2025-04-13 20:38:58,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:58,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:58,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:38:58,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:38:58,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:58,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:38:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:59,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11776414] [2025-04-13 20:38:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11776414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:59,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989348494] [2025-04-13 20:38:59,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:59,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:59,148 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:38:59,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 20:38:59,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:38:59,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:38:59,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:59,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:59,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 20:38:59,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:59,534 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:59,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 20:38:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:38:59,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:59,828 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:38:59,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 81 treesize of output 338 [2025-04-13 20:39:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 20:39:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989348494] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:02,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:02,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 9] total 34 [2025-04-13 20:39:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231832885] [2025-04-13 20:39:02,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:02,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:39:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:02,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:39:02,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:39:02,970 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:02,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 2369 transitions, 59654 flow. Second operand has 36 states, 36 states have (on average 5.0) internal successors, (180), 36 states have internal predecessors, (180), 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-04-13 20:39:02,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:02,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:02,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:14,937 INFO L116 PetriNetUnfolderBase]: 17581/25299 cut-off events. [2025-04-13 20:39:14,938 INFO L117 PetriNetUnfolderBase]: For 695937/695937 co-relation queries the response was YES. [2025-04-13 20:39:15,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310063 conditions, 25299 events. 17581/25299 cut-off events. For 695937/695937 co-relation queries the response was YES. Maximal size of possible extension queue 1353. Compared 157329 event pairs, 2455 based on Foata normal form. 1/23849 useless extension candidates. Maximal degree in co-relation 309653. Up to 22152 conditions per place. [2025-04-13 20:39:15,626 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2151 selfloop transitions, 849 changer transitions 1/3001 dead transitions. [2025-04-13 20:39:15,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 3001 transitions, 80133 flow [2025-04-13 20:39:15,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 20:39:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-13 20:39:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 437 transitions. [2025-04-13 20:39:15,629 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34140625 [2025-04-13 20:39:15,629 INFO L175 Difference]: Start difference. First operand has 591 places, 2369 transitions, 59654 flow. Second operand 40 states and 437 transitions. [2025-04-13 20:39:15,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 3001 transitions, 80133 flow [2025-04-13 20:39:28,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 3001 transitions, 77821 flow, removed 717 selfloop flow, removed 17 redundant places. [2025-04-13 20:39:28,978 INFO L231 Difference]: Finished difference. Result has 622 places, 2758 transitions, 71193 flow [2025-04-13 20:39:28,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58088, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=474, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1846, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=71193, PETRI_PLACES=622, PETRI_TRANSITIONS=2758} [2025-04-13 20:39:28,979 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 591 predicate places. [2025-04-13 20:39:28,979 INFO L485 AbstractCegarLoop]: Abstraction has has 622 places, 2758 transitions, 71193 flow [2025-04-13 20:39:28,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.0) internal successors, (180), 36 states have internal predecessors, (180), 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-04-13 20:39:28,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:28,980 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] [2025-04-13 20:39:28,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 20:39:29,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 20:39:29,180 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:29,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash -677932500, now seen corresponding path program 5 times [2025-04-13 20:39:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:29,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007725865] [2025-04-13 20:39:29,181 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:29,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:29,187 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:39:29,195 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:39:29,195 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:29,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:29,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007725865] [2025-04-13 20:39:29,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007725865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:29,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640541398] [2025-04-13 20:39:29,895 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:29,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:29,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:29,897 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:39:29,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 20:39:29,961 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:39:29,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:39:29,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:29,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:29,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-13 20:39:29,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:30,091 INFO L354 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-04-13 20:39:30,355 INFO L325 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2025-04-13 20:39:30,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 20:39:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:30,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:30,736 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:30,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 260 [2025-04-13 20:39:30,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:39:30,872 INFO L354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 54 [2025-04-13 20:39:30,907 INFO L325 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2025-04-13 20:39:30,907 INFO L354 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 184 treesize of output 149 [2025-04-13 20:39:30,978 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:30,978 INFO L354 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 138 treesize of output 124 [2025-04-13 20:39:30,985 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:30,986 INFO L354 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 97 treesize of output 72 [2025-04-13 20:39:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640541398] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:31,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:31,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 41 [2025-04-13 20:39:31,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280631995] [2025-04-13 20:39:31,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:31,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 20:39:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:31,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 20:39:31,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 20:39:31,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:31,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 2758 transitions, 71193 flow. Second operand has 43 states, 43 states have (on average 4.744186046511628) internal successors, (204), 43 states have internal predecessors, (204), 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-04-13 20:39:31,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:31,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:31,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:50,115 INFO L116 PetriNetUnfolderBase]: 23874/34525 cut-off events. [2025-04-13 20:39:50,115 INFO L117 PetriNetUnfolderBase]: For 1012304/1012304 co-relation queries the response was YES. [2025-04-13 20:39:51,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427718 conditions, 34525 events. 23874/34525 cut-off events. For 1012304/1012304 co-relation queries the response was YES. Maximal size of possible extension queue 1734. Compared 225405 event pairs, 2637 based on Foata normal form. 4/32722 useless extension candidates. Maximal degree in co-relation 427303. Up to 26158 conditions per place. [2025-04-13 20:39:51,786 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 2918 selfloop transitions, 1524 changer transitions 3/4445 dead transitions. [2025-04-13 20:39:51,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 4445 transitions, 122232 flow [2025-04-13 20:39:51,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 20:39:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2025-04-13 20:39:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 804 transitions. [2025-04-13 20:39:51,788 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3305921052631579 [2025-04-13 20:39:51,788 INFO L175 Difference]: Start difference. First operand has 622 places, 2758 transitions, 71193 flow. Second operand 76 states and 804 transitions. [2025-04-13 20:39:51,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 4445 transitions, 122232 flow [2025-04-13 20:40:13,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 4445 transitions, 119105 flow, removed 1128 selfloop flow, removed 9 redundant places. [2025-04-13 20:40:14,034 INFO L231 Difference]: Finished difference. Result has 712 places, 3818 transitions, 103134 flow [2025-04-13 20:40:14,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=69682, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=613, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=103134, PETRI_PLACES=712, PETRI_TRANSITIONS=3818} [2025-04-13 20:40:14,037 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 681 predicate places. [2025-04-13 20:40:14,037 INFO L485 AbstractCegarLoop]: Abstraction has has 712 places, 3818 transitions, 103134 flow [2025-04-13 20:40:14,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.744186046511628) internal successors, (204), 43 states have internal predecessors, (204), 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-04-13 20:40:14,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:14,037 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] [2025-04-13 20:40:14,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 20:40:14,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 20:40:14,238 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:14,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash -169590124, now seen corresponding path program 3 times [2025-04-13 20:40:14,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:14,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193813464] [2025-04-13 20:40:14,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:14,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:40:14,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:40:14,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:40:14,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:40:14,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:14,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193813464] [2025-04-13 20:40:14,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193813464] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:14,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108384843] [2025-04-13 20:40:14,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:14,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:14,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:14,989 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:40:14,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 20:40:15,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:40:15,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:40:15,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:40:15,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:15,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-13 20:40:15,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:15,185 INFO L354 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-04-13 20:40:15,522 INFO L325 Elim1Store]: treesize reduction 144, result has 38.2 percent of original size [2025-04-13 20:40:15,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 55 treesize of output 103 [2025-04-13 20:40:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:15,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:16,189 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:16,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 260 [2025-04-13 20:40:16,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:16,357 INFO L354 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 449 treesize of output 369 [2025-04-13 20:40:16,373 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:16,373 INFO L354 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 270 treesize of output 204 [2025-04-13 20:40:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:40:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108384843] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:16,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 40 [2025-04-13 20:40:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686598213] [2025-04-13 20:40:16,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:16,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 20:40:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 20:40:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 20:40:16,679 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:16,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 3818 transitions, 103134 flow. Second operand has 42 states, 42 states have (on average 4.619047619047619) internal successors, (194), 42 states have internal predecessors, (194), 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-04-13 20:40:16,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:16,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:16,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:53,017 INFO L116 PetriNetUnfolderBase]: 34873/50137 cut-off events. [2025-04-13 20:40:53,018 INFO L117 PetriNetUnfolderBase]: For 1685892/1685892 co-relation queries the response was YES. [2025-04-13 20:40:55,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619187 conditions, 50137 events. 34873/50137 cut-off events. For 1685892/1685892 co-relation queries the response was YES. Maximal size of possible extension queue 2280. Compared 337642 event pairs, 1835 based on Foata normal form. 4/47391 useless extension candidates. Maximal degree in co-relation 618703. Up to 20348 conditions per place. [2025-04-13 20:40:55,793 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1920 selfloop transitions, 4468 changer transitions 9/6397 dead transitions. [2025-04-13 20:40:55,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 826 places, 6397 transitions, 175981 flow [2025-04-13 20:40:55,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-04-13 20:40:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2025-04-13 20:40:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 1212 transitions. [2025-04-13 20:40:55,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3293478260869565 [2025-04-13 20:40:55,795 INFO L175 Difference]: Start difference. First operand has 712 places, 3818 transitions, 103134 flow. Second operand 115 states and 1212 transitions. [2025-04-13 20:40:55,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 826 places, 6397 transitions, 175981 flow [2025-04-13 20:41:40,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 6397 transitions, 172840 flow, removed 1560 selfloop flow, removed 5 redundant places. [2025-04-13 20:41:40,944 INFO L231 Difference]: Finished difference. Result has 860 places, 5812 transitions, 168887 flow [2025-04-13 20:41:40,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=100943, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2687, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=115, PETRI_FLOW=168887, PETRI_PLACES=860, PETRI_TRANSITIONS=5812} [2025-04-13 20:41:40,947 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 829 predicate places. [2025-04-13 20:41:40,947 INFO L485 AbstractCegarLoop]: Abstraction has has 860 places, 5812 transitions, 168887 flow [2025-04-13 20:41:40,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.619047619047619) internal successors, (194), 42 states have internal predecessors, (194), 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-04-13 20:41:40,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:40,948 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] [2025-04-13 20:41:40,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 20:41:41,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:41,148 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:41,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash -295947770, now seen corresponding path program 6 times [2025-04-13 20:41:41,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:41,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370965452] [2025-04-13 20:41:41,149 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:41:41,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:41,155 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-13 20:41:41,167 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:41:41,167 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:41:41,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 20:41:41,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 20:41:41,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:41:41,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:41:41,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:41,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 20:41:41,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 20:41:41,212 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 20:41:41,213 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:41:41,215 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:41:41,219 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:41:41,220 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:41:41,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 20:41:41,220 INFO L422 BasicCegarLoop]: Path program histogram: [27, 6, 3, 1, 1, 1] [2025-04-13 20:41:41,334 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:41:41,335 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:41:41,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:41:41 BasicIcfg [2025-04-13 20:41:41,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:41:41,343 INFO L158 Benchmark]: Toolchain (without parser) took 652495.58ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 97.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-04-13 20:41:41,343 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 86.4MB in the end (delta: 152.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:41:41,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.67ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 82.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:41:41,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.84ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 79.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:41:41,344 INFO L158 Benchmark]: Boogie Preprocessor took 58.06ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 77.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:41:41,344 INFO L158 Benchmark]: RCFGBuilder took 782.61ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 43.8MB in the end (delta: 33.2MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. [2025-04-13 20:41:41,344 INFO L158 Benchmark]: TraceAbstraction took 651335.55ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 43.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-04-13 20:41:41,345 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 86.4MB in the end (delta: 152.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.67ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 82.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.84ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 79.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 58.06ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 77.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 782.61ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 43.8MB in the end (delta: 33.2MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. * TraceAbstraction took 651335.55ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 43.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 92]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 int* A; [L39] 0 int* B; [L40] 0 _Atomic int res2; [L41] 0 int res1, M, N; [L73] 0 pthread_t t1, t2, t3; [L76] 0 M = __VERIFIER_nondet_int() [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L98] CALL 0 assume_abort_if_not(size >= 0) [L35] COND FALSE 0 !(!cond) [L98] RET 0 assume_abort_if_not(size >= 0) [L99] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L35] COND FALSE 0 !(!cond) [L99] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L101] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L102] 0 int i = 0; VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=0, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=1, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=2, res1=0, res2=0, size=2] [L102] COND FALSE 0 !(i < size) [L105] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L79] CALL, EXPR 0 create_fresh_int_array(N) [L98] CALL 0 assume_abort_if_not(size >= 0) [L35] COND FALSE 0 !(!cond) [L98] RET 0 assume_abort_if_not(size >= 0) [L99] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L35] COND FALSE 0 !(!cond) [L99] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L101] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L102] 0 int i = 0; VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=0, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=1, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=2, res1=0, res2=0, size=2] [L102] COND FALSE 0 !(i < size) [L105] 0 return arr; [L79] RET, EXPR 0 create_fresh_int_array(N) [L79] 0 B = create_fresh_int_array(N) [L81] CALL 0 assume_abort_if_not(M >= 0 && M < N) [L35] COND FALSE 0 !(!cond) [L81] RET 0 assume_abort_if_not(M >= 0 && M < N) [L84] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=0, res2=0, t1=3] [L85] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=0, res2=0, t1=3, t2=4] [L86] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=0, res2=0, t1=3, t2=4, t3=5] [L47] 1 int i=0; VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=0, res1=0, res2=0] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(A[i], B[i]) [L48] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L109] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L48] 1 res1 = plus(res1, plus(A[i], B[i])) [L47] 1 i++ VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=1, res1=-1, res2=0] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(A[i], B[i]) [L48] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L109] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L48] 1 res1 = plus(res1, plus(A[i], B[i])) [L47] 1 i++ VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=2, res1=0, res2=0] [L55] 2 int i=0; [L55] COND TRUE 2 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 2 !(!cond) [L109] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 2 !(!cond) [L110] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 2 return a + b; [L56] RET, EXPR 2 plus(A[i], B[i]) [L56] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L109] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 2 !(!cond) [L109] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 2 !(!cond) [L110] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 2 return a + b; [L56] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L56] 2 int tmp = plus(res2, plus(A[i], B[i])); [L64] 3 int i=M; [L64] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 3 !(!cond) [L109] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 3 !(!cond) [L110] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 3 return a + b; [L65] RET, EXPR 3 plus(A[i], B[i]) [L65] CALL, EXPR 3 plus(res2, plus(A[i], B[i])) [L109] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 3 !(!cond) [L109] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 3 !(!cond) [L110] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 3 return a + b; [L65] RET, EXPR 3 plus(res2, plus(A[i], B[i])) [L65] 3 int tmp = plus(res2, plus(A[i], B[i])); [L66] 3 res2 = tmp VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=1, res1=0, res2=1, tmp=1] [L57] 2 res2 = tmp VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=0, res1=0, res2=-1, tmp=-1] [L55] 2 i++ [L55] COND FALSE 2 !(i